Semidefinite programming and integer programming
We survey how semidefinite programming can be used for finding good approximative solutions to hard combinatorial optimization problems. CitationPreliminary version appeared as Report PNA-R0210, CWI, Amsterdam, April 2002. To appear as Chapter in the Handbook on Discrete Optimization, K. Aardal, G. Nemhauser, R. Weismantel, eds., Elsevier Publishers.ArticleDownload View PDF