Semidefinite Programming and Constraint Programming

Willem-Jan Hoeve ()
Additional contact information
Willem-Jan Hoeve: Carnegie Mellon University

Chapter Chapter 22 in Handbook on Semidefinite, Conic and Polynomial Optimization, 2012, pp 635-668 from Springer

Abstract: Abstract 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.

Keywords: Constraint Programming; Global Constraint; Semidefinite Programming; Linear Programming Relaxation; Linear Relaxation (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-1-4614-0769-0_22

Ordering information: This item can be ordered from
http://www.springer.com/9781461407690

DOI: 10.1007/978-1-4614-0769-0_22

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().