The Polytope of Tree-Structured Binary Constraint Satisfaction Problems

DOI10.1007/978-3-540-68155-7_39MaRDI QIDQ5387646zbMATH OpenOpenAlexFDO

Authors Meinolf Sellmann

Publication date 27 May 2008

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-68155-7_39

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width
• The power of linear programming for general-valued CSPs
• Characterising tractable constraints
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• The partial constraint satisfaction problem: Facets and lifting theorems

Cited in

(9)

• The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width
• Constraint satisfaction with bounded treewidth revisited
• Binary constraint satisfaction problems defined by excluded topological minors
• Extended formulation for CSP that is compact for instances of bounded treewidth
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• On tree-preserving constraints
• Extension complexity, MSO logic, and treewidth
• scientific article; zbMATH DE number 5373718 (Why is no real title available?)
• Binary space partitioning trees as an alternative representation of polytopes

This page was built for publication: The Polytope of Tree-Structured Binary Constraint Satisfaction Problems

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