Semidefinite Relaxations for Integer Programming
Author:
- 6 November 2009
- book chapter
- Published by Springer Nature
- p. 687-726
Abstract
No abstract availableKeywords
This publication has 61 references indexed in Scilit:
- Semidefinite Programs and Combinatorial Optimization2003
- A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection ProblemsLecture Notes in Computer Science, 2001
- Bundle Methods to Minimize the Maximum Eigenvalue Function2000
- Handbook of Semidefinite Programming2000
- Incorporating Inequality Constraints in the Spectral Bundle Method1998
- Combining semidefinite and polyhedral relaxations for integer programsLecture Notes in Computer Science, 1995
- The hypermetric cone is polyhedralCombinatorica, 1993
- Convex Functions of One Real Variable1993
- A lift-and-project cutting plane algorithm for mixed 0–1 programsMathematical Programming, 1993
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970