Semidefinite programming and constraint programming
From MaRDI portal
Publication:2802541
DOI10.1007/978-1-4614-0769-0_22zbMATH Open1334.90121OpenAlexW164225028MaRDI QIDQ2802541FDOQ2802541
Recommendations
Cites work
- scientific article; zbMATH DE number 5485536 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1303558 (Why is no real title available?)
- scientific article; zbMATH DE number 1336257 (Why is no real title available?)
- scientific article; zbMATH DE number 1114003 (Why is no real title available?)
- scientific article; zbMATH DE number 2080319 (Why is no real title available?)
- scientific article; zbMATH DE number 1550909 (Why is no real title available?)
- scientific article; zbMATH DE number 1795723 (Why is no real title available?)
- scientific article; zbMATH DE number 956857 (Why is no real title available?)
- A hybrid constraint programming and semidefinite programming approach for the stable set problem
- A hybrid exact algorithm for the TSPTW
- A new approach for weighted constraint satisfaction
- An improved semidefinite programming relaxation for the satisfiability problem
- Approximation algorithms for MAX-4-SAT and rounding procedures for semidefinite programs
- Biclique completion problems for multicast network design
- Computational Experience with Stable Set Relaxations
- Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
- Connection between semidefinite relaxations of the max-cut and stable set problems
- Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness
- Constraint and integer programming. Toward a unified methodology.
- Cost-based arc consistency for global cardinality constraints
- Cost-based filtering for shorter path constraints
- Embedding relaxations in global constraints for solving TSP and TSPTW
- Exploiting semidefinite relaxations in constraint programming
- Fixing Variables in Semidefinite Relaxations
- Geometric algorithms and combinatorial optimization
- Handbook of constraint programming.
- How to Round Any CSP
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES
- Integrated methods for optimization.
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Local branching
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- Near-optimal algorithms for maximum constraint satisfaction problems
- New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
- On global warming: Flow-based soft global constraints
- On semidefinite programming relaxations of \((2+p)\)-SAT
- On the Shannon capacity of a graph
- Optimization-oriented global constraints
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
- Principles of Constraint Programming
- Relaxations of the satisfiability problem using semidefinite programming
- Search and strategies in OPL
- Semidefinite programming and integer programming
- Solving TSP through the integration of OR and CP techniques
- Symmetry in integer linear programming
- The essence of constraint propagation
- k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach
Cited in
(4)
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)
