Exploiting semidefinite relaxations in constraint programming

DOI10.1016/j.cor.2005.01.011zbMath1086.90044OpenAlexW2097660176MaRDI QIDQ2489123

Willem-Jan van Hoeve

Publication date: 16 May 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.01.011

zbMATH Keywords

Semidefinite programmingConstraint programmingLimited discrepancy search

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Related Items (1)

Semidefinite Programming and Constraint Programming

Uses Software

• ATLAS
• CSDP
• LAPACK
• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometric algorithms and combinatorial optimization
• The maximum clique problem
• Connection between semidefinite relaxations of the max-cut and stable set problems
• Semidefinite programming
• A fast algorithm for the maximum clique problem
• Principles of Constraint Programming
• LAPACK Users' Guide
• On the Shannon capacity of a graph
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Solving Graph Bisection Problems with Semidefinite Programming
• Computational Experience with Stable Set Relaxations
• CSDP, A C library for semidefinite programming
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Principles and Practice of Constraint Programming – CP 2003
• Principles and Practice of Constraint Programming – CP 2003
• Automated empirical optimizations of software and the ATLAS project

This page was built for publication: Exploiting semidefinite relaxations in constraint programming