Integer and combinatorial optimization
Integer and combinatorial optimization
Tree clustering for constraint networks (research note)
Artificial Intelligence
A hierarchy of relaxation between the continuous and convex hull representations
SIAM Journal on Discrete Mathematics
On the parallel complexity of discrete relaxation in constraint satisfaction networks
Artificial Intelligence
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Combining arc-consistency and dual lagrangean relaxation for filtering CSPs
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A totally unimodular description of the consistent value polytope for binary constraint programming
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
AND/OR branch-and-bound search for pure 0/1 integer linear programming problems
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
On the Facial Structure of the Alldifferent System
SIAM Journal on Discrete Mathematics
| Hi-index | 0.00 |
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.