Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- 1 August 1998
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 82 (3) , 291-315
- https://doi.org/10.1007/bf01580072
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Exact ground states of Ising spin glasses: New experimental results with a branch-and-cut algorithmJournal of Statistical Physics, 1995
- Ground-state magnetization of Ising spin glassesPhysical Review B, 1994
- Combinatorial Properties and the Complexity of a Max-cut ApproximationEuropean Journal of Combinatorics, 1993
- Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean FunctionsMathematics of Operations Research, 1993
- Laplacian eigenvalues and the maximum cut problemMathematical Programming, 1993
- Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 OptimizationSIAM Journal on Discrete Mathematics, 1992
- The max-cut problem and quadratic 0–1 optimization; polyhedral aspects, relaxations and boundsAnnals of Operations Research, 1991
- Experiments in quadratic 0–1 programmingMathematical Programming, 1989
- The indefinite zero-one quadratic problemDiscrete Applied Mathematics, 1984
- The max-cut problem on graphs not contractible to K5Operations Research Letters, 1983