Semidefinite Programming and Constraint Programming

DOI10.1007/978-1-4614-0769-0_22zbMath1334.90121OpenAlexW164225028MaRDI QIDQ2802541

Willem-Jan van Hoeve

Publication date: 26 April 2016

Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-0769-0_22

zbMATH Keywords

constraint programming

Mathematics Subject Classification ID

Semidefinite programming (90C22) Applications of mathematical programming (90C90) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Uses Software

• MaxSolver
• TSPTW
• XPRESS
• OPL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
• A new approach for weighted constraint satisfaction
• Integrated methods for optimization.
• Geometric algorithms and combinatorial optimization
• Connection between semidefinite relaxations of the max-cut and stable set problems
• Local branching
• Embedding relaxations in global constraints for solving TSP and TSPTW
• An improved semidefinite programming relaxation for the satisfiability problem
• On semidefinite programming relaxations of \((2+p)\)-SAT
• Optimization-oriented global constraints
• Cost-based arc consistency for global cardinality constraints
• Constraint and integer programming. Toward a unified methodology.
• The essence of constraint propagation
• Relaxations of the satisfiability problem using semidefinite programming
• Biclique completion problems for multicast network design
• Cost-based filtering for shorter path constraints
• MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
• Exploiting semidefinite relaxations in constraint programming
• On global warming: Flow-based soft global constraints
• Solving TSP through the Integration of OR and CP Techniques
• Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
• A Hybrid Exact Algorithm for the TSPTW
• Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes
• Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness
• Principles of Constraint Programming
• Symmetry in Integer Linear Programming
• k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach
• On the Shannon capacity of a graph
• New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Computational Experience with Stable Set Relaxations
• Fixing Variables in Semidefinite Relaxations
• Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES
• How to Round Any CSP
• Search and strategies in OPL
• Principles and Practice of Constraint Programming – CP 2003
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Principles and Practice of Constraint Programming – CP 2004
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Semidefinite Programming and Constraint Programming