Author of the publication

Semidefinite programming for discrete optimization and matrix completion problems.

, and . Discret. Appl. Math., 123 (1-3): 513-577 (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Improved exact approaches for row layout problems with departments of equal length., , and . Eur. J. Oper. Res., 270 (2): 514-529 (2018)Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems., , and . J. Glob. Optim., 59 (2-3): 227-242 (2014)Provably near-optimal solutions for very large single-row facility layout problems., and . Optim. Methods Softw., 24 (4-5): 805-817 (2009)Improving the linear relaxation of maximum k-cut with semidefinite-based constraints., , and . EURO J. Comput. Optim., 7 (2): 123-151 (2019)An Exact Approach for the Combined Cell Layout Problem., and . OR, page 275-281. Springer, (2012)Mathematical optimization approach for facility layout on several rows., and . Optim. Lett., 15 (1): 9-23 (2021)Complexity of near-optimal robust versions of multilevel optimization problems., , and . Optim. Lett., 15 (8): 2597-2610 (2021)An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs.. Ann. Math. Artif. Intell., 48 (1-2): 1-14 (2006)Preface to the special issue of INFOR on "continuous optimization and applications in machine learning and data analytics"., , , and . INFOR Inf. Syst. Oper. Res., 58 (2): 167 (2020)Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem., and . Discret. Appl. Math., 119 (1-2): 79-106 (2002)