Sciweavers

Share
CPAIOR
2007
Springer

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

9 years 4 months ago
The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width
We show how to efficiently model binary constraint problems (BCP) as integer programs. After considering tree-structured BCPs first, we show that a Sherali-Adams-like procedure results in a polynomial-size linear programming description of the convex hull of all integer feasible solutions when the BCP that is given has bounded tree-width.
Meinolf Sellmann, Luc Mercier, Daniel H. Leventhal
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where CPAIOR
Authors Meinolf Sellmann, Luc Mercier, Daniel H. Leventhal
Comments (0)
books