×

zbMATH — the first resource for mathematics

Semidefinite programming and constraint programming. (English) Zbl 1334.90121
Anjos, Miguel F. (ed.) et al., Handbook on semidefinite, conic and polynomial optimization. New York, NY: Springer (ISBN 978-1-4614-0768-3/hbk; 978-1-4614-0769-0/ebook). International Series in Operations Research & Management Science 166, 635-668 (2012).
Summary: Recently, semidefinite programming relaxations have been applied in constraint programming to take advantage of the high-quality bounds and precise heuristic guidance during the search for a solution. The purpose of this chapter is to present an overview of these developments, and to provide future research prospects.
For the entire collection see [Zbl 1235.90002].
MSC:
90C22 Semidefinite programming
90C90 Applications of mathematical programming
90-02 Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Software:
MaxSolver; OPL; TSPTW; XPRESS
PDF BibTeX XML Cite
Full Text: DOI