The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width

DOI10.1007/978-3-540-72397-4_20MaRDI QIDQ3612424zbMATH OpenOpenAlexFDO

Authors Meinolf Sellmann, Luc Mercier, D. Leventhal

Publication date 10 March 2009

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72397-4_20

zbMATH Keywords

constraint programmingcutting planesinteger programmingpolyhedral combinatorics

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Recommendations

• The Polytope of Tree-Structured Binary Constraint Satisfaction Problems
• scientific article; zbMATH DE number 2084733
• LP formulations for polynomial optimization problems
• The power of linear programming for general-valued CSPs
• Extended formulation for CSP that is compact for instances of bounded treewidth

Cited in

(8)

• Submodularity and its application to some global constraints
• A polyhedral approach to the \textit{alldifferent} system
• Extension complexity, MSO logic, and treewidth
• scientific article; zbMATH DE number 2084733 (Why is no real title available?)
• LP formulations for polynomial optimization problems
• The Polytope of Tree-Structured Binary Constraint Satisfaction Problems
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Extended formulation for CSP that is compact for instances of bounded treewidth

This page was built for publication: The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612424)