Branch-and-Infer: a Framework for Combining CP and IP

We develop a unifying view of integer linear programming and finite domain constraint programming. We present the two modeling and solution approaches in a uniform framework, branch-and-infer. The goal of this framework is to clarify the relationship between the two techniques, and to indicate possible ways towards their integration. We illustrate the different concepts by examples from discrete tomography and supply chain optimization.

[1]  Laurence A. Wolsey,et al.  Cutting planes for integer programs with general integer variables , 1998, Math. Program..

[2]  Gerhard Reinelt,et al.  Traveling salesman problem , 2012 .

[3]  Christoph A. Schneeweiss,et al.  Hierarchies in Distributed Decision Making , 1999 .

[4]  Nicolas Beldiceanu,et al.  Introducing global constraints in CHIP , 1994 .

[5]  Gerhard J. Woeginger,et al.  The reconstruction of polyominoes from their orthogonal projections , 2001, Inf. Process. Lett..

[6]  Hartmut Stadtler,et al.  The Capacitated Lot-Sizing Problem with Linked Lot Sizes , 2003, Manag. Sci..

[7]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[8]  Laurence A. Wolsey,et al.  Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs , 2001, Manag. Sci..

[9]  Michael Jünger,et al.  SCIL - Symbolic Constraints in Integer Linear Programming , 2002, ESA.

[10]  Philippe Baptiste,et al.  Constraint-based scheduling , 2001 .

[11]  Meinolf Sellmann,et al.  Cost Based Filtering for the Constrained Knapsack Problem , 2002, Ann. Oper. Res..

[12]  Andrea Lodi,et al.  Cost-Based Domain Filtering , 1999, CP.

[13]  Christian Bessiere,et al.  Domain Filtering Consistencies , 2011, J. Artif. Intell. Res..

[14]  Michael A. Trick.  A Dynamic Programming Approach for Consistency and Propagation for Knapsack Constraints , 2003, Ann. Oper. Res..

[15]  Nicolas Beldiceanu,et al.  Extending CHIP in order to solve complex scheduling and placement problems , 1993, JFPL.

[16]  Alexander Bockmayr,et al.  Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming , 1998, INFORMS J. Comput..

[17]  Friedrich Eisenbrand,et al.  Combining Logic and Optimization in Cutting Plane Theory , 2000, FroCoS.

[18]  Laurence A. Wolsey,et al.  Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation , 2002, Manag. Sci..

[19]  Laurence A. Wolsey,et al.  The 0-1 Knapsack problem with a single continuous variable , 1999, Math. Program..

[20]  Laurence A. Wolsey,et al.  bc–opt: a branch-and-cut code for mixed integer programs , 1999, Math. Program..