A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
- 25 June 2007
- book chapter
- Published by Springer Nature
- p. 295-309
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 ProblemMathematical Programming, 2006
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cutRAIRO - Operations Research, 2006
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and EquipartitionMathematical Programming, 2005
- New approaches for optimizing over the semimetric polytopeMathematical Programming, 2005
- Minimizing breaks by maximizing cutsOperations Research Letters, 2003
- Exact ground states of Ising spin glasses: New experimental results with a branch-and-cut algorithmJournal of Statistical Physics, 1995
- Laplacian eigenvalues and the maximum cut problemMathematical Programming, 1993
- OR-Library: Distributing Test Problems by Electronic MailJournal of the Operational Research Society, 1990
- Experiments in quadratic 0–1 programmingMathematical Programming, 1989
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout DesignOperations Research, 1988