SIMPL: A System for Integrating Optimization Techniques

In recent years, the Constraint Programming (CP) and Operations Research (OR) communities have explored the advantages of combining CP and OR techniques to formulate and solve combinatorial optimization problems. These advantages include a more versatile modeling framework and the ability to combine complementary strengths of the two solution technologies. This research has reached a stage at which further development would benefit from a general-purpose modeling and solution system. We introduce here a system for integrated modeling and solution called SIMPL. Our approach is to view CP and OR techniques as special cases of a single method rather than as separate methods to be combined. This overarching method consists of an infer-relax-restrict cycle in which CP and OR techniques may interact at any stage. We describe the main features of SIMPL and illustrate its usage with examples.

[1]  Erlendur S. Thorsteinsson.  Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming , 2001, CP.

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

[3]  Vipul Jain,et al.  Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems , 2001, INFORMS J. Comput..

[4]  John N. Hooker,et al.  Logic-Based Methods for Optimization , 1994, PPCP.

[5]  John N. Hooker,et al.  Logic, Optimization, and Constraint Programming , 2002, INFORMS J. Comput..

[6]  Henri Beringer,et al.  Combinatorial Problem Solving in Constraint Logic Programming with Cooperating Solvers , 1995, Logic Programming: Formal Methods and Practical Applications.

[7]  Jean-Charles Régin,et al.  A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.

[8]  John N. Hooker,et al.  Mixed Global Constraints and Inference in Hybrid CLP-IP Solvers , 2000, Electron. Notes Discret. Math..

[9]  Philippe Refalo.  Tight Cooperation and Its Application in Piecewise Linear Optimization , 1999, CP.

[10]  Andrea Lodi,et al.  Cutting Planes in Constraint Programming: A Hybrid Approach , 2000, CP.

[11]  María Auxilio Osorio Lama,et al.  Mixed Logical-linear Programming , 1999, Discret. Appl. Math..

[12]  Markus P. J. Fromherz,et al.  Constraint-based scheduling , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[13]  Egon Balas,et al.  programming: Properties of the convex hull of feasible points * , 1998 .

[14]  Toby Walsh,et al.  Principles and Practice of Constraint Programming — CP 2001: 7th International Conference, CP 2001 Paphos, Cyprus, November 26 – December 1, 2001 Proceedings , 2001, Lecture Notes in Computer Science.

[15]  Hemant K. Bhargava,et al.  Computational modeling and problem solving in the networked world : interfaces in computer science and operations research , 2003 .

[16]  Rina Dechter,et al.  Principles and Practice of Constraint Programming – CP 2000 , 2001, Lecture Notes in Computer Science.

[17]  Michela Milano,et al.  The Role of Integer Programming Techniques in Constraint Programming's Global Constraints , 2002, INFORMS J. Comput..

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

[19]  Hong Yan,et al.  Tight representation of logical constraints as cardinality rules , 1999, Math. Program..

[20]  Mark Wallace,et al.  Hybrid Benders Decomposition Algorithms in Constraint Logic Programming , 2001, CP.

[21]  Hong Yan,et al.  Representations of the all_different Predicate of Constraint Satisfaction in Integer Programming , 2001, INFORMS J. Comput..

[22]  Joxan Jaffar,et al.  Principles and Practice of Constraint Programming – CP’99 , 1999, Lecture Notes in Computer Science.

[23]  N. Biggs.  THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[24]  Pascal Van Hentenryck,et al.  Principles and practice of constraint programming: The Newport papers , 1996, Computers & Mathematics with Applications.

[25]  Hong Yan,et al.  A Relaxation of the Cumulative Constraint , 2002, CP.

[26]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

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

[28]  Tallys H. Yunes.  On the Sum Constraint: Relaxation and Applications , 2002, CP.

[29]  Christoph Beierle,et al.  Logic Programming: Formal Methods and Practical Applications , 1994 .

[30]  Pascal Van Hentenryck.  The OPL optimization programming language , 1999 .

[31]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[32]  John N. Hooker.  A Framework for Integrating Solution Methods , 2003 .

[33]  Philippe Refalo,et al.  Linear Formulation of Constraint Programming Models and Hybrid Solvers , 2000, CP.

[34]  J. Hooker,et al.  Logic-based Benders decomposition , 2003 .

[35]  Mark Wallace,et al.  A new approach to integrating mixed integer programming and constraint logicprogramming , 1999, Ann. Oper. Res..

[36]  Nicolas Barnier,et al.  Solving the Kirkman's schoolgirl problem in a few seconds , 2002 .

[37]  John N. Hooker,et al.  On Integrating Constraint Propagation and Linear Programming for Combinatorial Optimization , 1999, AAAI/IAAI.