Author of the publication

Semidefinite and Lagrangian Relaxations for Hard Combinatorial Problems.

. System Modelling and Optimization, volume 174 of IFIP Conference Proceedings, page 269-310. Kluwer, (1999)

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

A New Lower Bound Via Projection for the Quadratic Assignment Problem., , and . Math. Oper. Res., 17 (3): 727-739 (1992)Protein Structure by Semidefinite Facial Reduction., , , , , and . RECOMB, volume 7262 of Lecture Notes in Computer Science, page 1-11. Springer, (2012)Semidefinite and Lagrangian Relaxations for Hard Combinatorial Problems.. System Modelling and Optimization, volume 174 of IFIP Conference Proceedings, page 269-310. Kluwer, (1999)Generalizations of Slater's constraint qualification for infinite convex programs., and . Math. Program., (1992)A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem., , , and . Comput. Optim. Appl., 78 (3): 853-891 (2021)Trust Region Problems and Nonsymmetric Eigenvalue Perturbations., and . SIAM J. Matrix Anal. Appl., 15 (3): 755-778 (July 1994)Pseudolinear Programming., and . SIAM Rev., 41 (4): 795-805 (1999)Error Bounds and Singularity Degree in Semidefinite Programming., , and . SIAM J. Optim., 31 (1): 812-836 (2021)Preface., and . J. Comb. Optim., 2 (1): 7 (1998)Extreme point inequalities and geometry of the rank sparsity ball., , and . Math. Program., 152 (1-2): 521-544 (2015)