Consistency for 0-1 Programming

Concepts of consistency have long played a key role in constraint programming but never developed in integer programming (IP). Consistency nonetheless plays a role in IP as well. For example, cutting planes can reduce backtracking by achieving various forms of consistency as well as by tightening the linear programming (LP) relaxation. We introduce a type of consistency that is particularly suited for 0–1 programming and develop the associated theory. We define a 0–1 constraint set as LP-consistent when any partial assignment that is consistent with its linear programming relaxation is consistent with the original 0–1 constraint set. We prove basic properties of LP-consistency, including its relationship with Chvatal-Gomory cuts and the integer hull. We show that a weak form of LP-consistency can reduce or eliminate backtracking in a way analogous to k-consistency. This work suggests a new approach to the reduction of backtracking in IP that focuses on cutting off infeasible partial assignments rather than fractional solutions.

[1]  Eugene C. Freuder.  A Sufficient Condition for Backtrack-Free Search , 1982, JACM.

[2]  John N. Hooker,et al.  Input Proofs and Rank One Cutting Planes , 1989, INFORMS J. Comput..

[3]  Willard Van Orman Quine,et al.  The Problem of Simplifying Truth Functions , 1952 .

[4]  Willard Van Orman Quine,et al.  A Way to Simplify Truth Functions , 1955 .

[5]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[6]  E. Balas.  Disjunctive programming and a hierarchy of relaxations for discrete optimization problems , 1985 .

[7]  Krzysztof R. Apt,et al.  Principles of constraint programming , 2003 .

[8]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[9]  Chin-Liang Chang.  The Unit Proof and the Input Proof in Theorem Proving , 1970, JACM.

[10]  John N. Hooker.  Integrated Methods for Optimization, 2nd ed , 2012 .

[11]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[12]  John N. Hooker,et al.  Integrated methods for optimization , 2011, International series in operations research and management science.

[13]  Egon Balas,et al.  A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..

[14]  John N. Hooker,et al.  Projection, consistency, and George Boole , 2015, Constraints.

[15]  Vasek Chvátal,et al.  Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..

[16]  Ernest Davis,et al.  Constraint Propagation with Interval Labels , 1987, Artif. Intell..

[17]  Jean-Charles Régin,et al.  Global Constraints: A Survey , 2011 .

[18]  Pascal Van Hentenryck.  Constraint satisfaction in logic programming , 1989, Logic programming.

[19]  Eugene C. Freuder.  Synthesizing constraint expressions , 1978, CACM.

[20]  Pascal Van Hentenryck,et al.  Hybrid optimization : the ten years of CPAIOR , 2011 .