Semidefinite programming and constraint programming
DOI10.1007/978-1-4614-0769-0_22zbMATH Open1334.90121OpenAlexW164225028MaRDI QIDQ2802541FDOQ2802541
Authors: 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
Recommendations
Applications of mathematical programming (90C90) Semidefinite programming (90C22) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cites Work
- Embedding relaxations in global constraints for solving TSP and TSPTW
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- Geometric algorithms and combinatorial optimization
- Handbook of constraint programming.
- Title not available (Why is that?)
- On the Shannon capacity of a graph
- Local branching
- Cost-based arc consistency for global cardinality constraints
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
- Optimization-oriented global constraints
- Title not available (Why is that?)
- Principles of Constraint Programming
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Integrated methods for optimization.
- New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
- On global warming: Flow-based soft global constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
- Constraint and integer programming. Toward a unified methodology.
- Biclique completion problems for multicast network design
- Symmetry in integer linear programming
- Semidefinite programming and integer programming
- The essence of constraint propagation
- Fixing Variables in Semidefinite Relaxations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computational Experience with Stable Set Relaxations
- A new approach for weighted constraint satisfaction
- A hybrid exact algorithm for the TSPTW
- Title not available (Why is that?)
- Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES
- Title not available (Why is that?)
- Solving TSP through the integration of OR and CP techniques
- Search and strategies in OPL
- An improved semidefinite programming relaxation for the satisfiability problem
- On semidefinite programming relaxations of \((2+p)\)-SAT
- Relaxations of the satisfiability problem using semidefinite programming
- Title not available (Why is that?)
- Exploiting semidefinite relaxations in constraint programming
- Connection between semidefinite relaxations of the max-cut and stable set problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Principles and Practice of Constraint Programming – CP 2004
- How to Round Any CSP
- Cost-based filtering for shorter path constraints
- Near-optimal algorithms for maximum constraint satisfaction problems
- k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach
- A hybrid constraint programming and semidefinite programming approach for the stable set problem
- Approximation algorithms for MAX-4-SAT and rounding procedures for semidefinite programs
- Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness
- Principles and Practice of Constraint Programming – CP 2004
Cited In (4)
Uses Software
This page was built for publication: Semidefinite programming and constraint programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802541)
