The Polytope of Tree-Structured Binary Constraint Satisfaction Problems

DOI10.1007/978-3-540-68155-7_39zbMath1142.90505OpenAlexW1496223874MaRDI QIDQ5387646

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)

Related Items (2)

Extended formulation for CSP that is compact for instances of bounded treewidth ⋮ Unnamed Item

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