Sciweavers

Share
CPAIOR
2006
Springer

A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming

10 years 1 months ago
A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming
Abstract. We present a theoretical study on the idea of using mathematical programming relaxations for filtering binary constraint satisfaction problems. We introduce the consistent value polytope and give a linear programming description that is provably tighter than a recently studied formulation. We then provide an experimental study that shows that, despite the theoretical progress, in practice filtering based on mathematical programming relaxations continues to perform worse than standard arc-consistency algorithms for binary constraint satisfaction problems.
Ionut D. Aron, Daniel H. Leventhal, Meinolf Sellma
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2006
Where CPAIOR
Authors Ionut D. Aron, Daniel H. Leventhal, Meinolf Sellmann
Comments (0)
books