Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- 15 June 2002
- journal article
- Published by Elsevier BV in Discrete Applied Mathematics
- Vol. 119 (1-2), 79-106
- https://doi.org/10.1016/s0166-218x(01)00266-9
Abstract
No abstract availableKeywords
This publication has 37 references indexed in Scilit:
- Strong duality for a trust-region type relaxation of the quadratic assignment problemLinear Algebra and its Applications, 1999
- Semidefinite programming and combinatorial optimizationApplied Numerical Mathematics, 1999
- SDPLIB 1.2, a library of semidefinite programming test problemsOptimization Methods and Software, 1999
- CSDP, A C library for semidefinite programmingOptimization Methods and Software, 1999
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- A recipe for semidefinite relaxation for (0,1)-quadratic programmingJournal of Global Optimization, 1995
- A hierarchy of relaxations and convex hull characterizations for mixed-integer zero—one programming problemsDiscrete Applied Mathematics, 1994
- Nonconvex optimization problem: The infinite-horizon linear-quadratic control problem with quadratic constraintsSystems & Control Letters, 1992
- Positive definite completions of partial Hermitian matricesLinear Algebra and its Applications, 1984
- The max-cut problem on graphs not contractible to K5Operations Research Letters, 1983