Semidefinite programming and combinatorial optimization
Author:
- 1 March 1999
- journal article
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 29 (3) , 255-281
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Improved approximation algorithms for MAXk-CUT and MAX BISECTIONAlgorithmica, 1997
- An algorithm for 3-colorable graphsInformation Processing Letters, 1997
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial OptimizationSIAM Journal on Optimization, 1995
- A computational study of graph partitioningMathematical Programming, 1994
- The hypermetric cone is polyhedralCombinatorica, 1993
- A bound on the k-gonality of facets of the hypermetric cone and related complexity problemsComputational Geometry, 1993
- Laplacian eigenvalues and the maximum cut problemMathematical Programming, 1993
- Lower Bounds for the Partitioning of GraphsIBM Journal of Research and Development, 1973
- Some convexity theorems for matricesGlasgow Mathematical Journal, 1971
- Duality and asymptotic solvability over conesBulletin of the American Mathematical Society, 1969