Semidefinite Programming and Constraint Programming

@inproceedings{HoeveSemidefinitePA,
  title={Semidefinite Programming and Constraint Programming},
  author={Willem-Jan Van Hoeve}
}
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.