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

DOI10.1007/978-3-540-72397-4_20zbMath1214.90105OpenAlexW1791220908MaRDI QIDQ3612424

Luc Mercier, D. Leventhal, Meinolf Sellmann

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

integer programmingcutting planesconstraint programmingpolyhedral combinatorics

Mathematics Subject Classification ID

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

Related Items (4)

Submodularity and its application to some global constraints ⋮ A polyhedral approach to the \textit{alldifferent} system ⋮ Extended formulation for CSP that is compact for instances of bounded treewidth ⋮ Unnamed Item

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