Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming

References

• Aggoun A. , Beldiceanu N. Extending CHIP in Order to Solve Complex Scheduling and Placement Problems. Mathl. Comput. Modelling (1993) 17 7 57 73 Crossref, Google Scholar
• De Backer B. , Beringer H. Cooperative Solvers and Global Constraints: The Case of Linear Arithmetic Constraints. Postconference Workshop on Constraints, Databases, and Logic Programming, ILPS'95 (1995) Google Scholar
• Balas E. , Ceria S. , Cornuéjols G. Mixed 0–1 Programming by Lift-and-Project in a Branch-and-Cut Framework. Management Science (1996) 42 9 1229 1246 Link, Google Scholar
• Balas E. , Ceria S. , Cornuéjols G. , Natraj N. R. Gomory cuts revisited. Operations Research Letters (1996) 19 Crossref, Google Scholar
• Balas E. , Mazzola J. B. Nonlinear 0–1 programming: I. Linearization techniques. Mathematical Programming (1984) 30 1 21 Crossref, Google Scholar
• Balas E. , Mazzola J. B. Nonlinear 0–1 Programming: II. Dominance Relations and Algorithms. Mathematical Programming (1984) 30 22 45 Crossref, Google Scholar
• Baptiste P. , Le Pape C. Edge-Finding Constraint Propagation Algorithms for Disjunctive and Cumulative Scheduling. Proc. 15th Workshop U.K. Planning Special Interest Group (1996) Liverpool Google Scholar
• Barth P. Logic-based 0–1 constraint programming (1996) (Kluwer, Boston, MA) . Operations Research/Computer Science Interfaces Series Crossref, Google Scholar
• Barth P. , Bockmayr A. , Sterling L. Finite Domain and Cutting Plane Techniques in CLP(BP). Logic Programming, 12th International Conference ICLP'95, Kanagawa, Japan (1995) (MIT Press, Cambridge, MA) 133 147 Crossref, Google Scholar
• Barwise J. , Barwise J. An Introduction to First-Order Logic. Handbook of Mathematical Logic (1977) (North Holland, Amsterdam) 5 46 Crossref, Google Scholar
• Beasley J. E. OR-Library: Distributing Test Problems by Electronic Mail. Journal of the Operational Research Society (1990) 41 11 1069 1072 . http://mscmga.ms.ic.ac.uk/inf.html Google Scholar
• Beldiceanu N. , Aggoun A. , Contejean E. Introducing Constrained Sequences in CHIP. (1996) . Technical Report, COSYTEC S.A., Orsay, France Google Scholar
• Beldiceanu N. , Contejean E. Introducing Global Constraints in CHIP. Mathl. Comput. Modelling (1994) 20 12 97 123 Crossref, Google Scholar
• Beringer H. , de Backer B. , Beierle C. , Plümer L. Combinatorial Problem Solving in Constraint Logic Programming with Cooperating Solvers. Logic Programming: Formal methods and practical applications (1995) (Elsevier, Amsterdam) 245 272 Google Scholar
• Bockmayr A. Using strong cutting planes in constraint logic programming [extended abstract]. Operations Research '93. 18th Symposium on Operations Research, Köln (1993) (Physica-Verlag, Heidelberg) Google Scholar
• Bockmayr A. Solving Pseudo-Boolean Constraints. Constraint Programming: Basics and Trends (1995) (Springer, Berlin, LNCS 910) 22 38 Crossref, Google Scholar
• Caseau Y. , Laburthe F. CLAIRE: Combining Objects and Rules for Problem Solving. JICSLP'96 workshop on multiparadigm logic programming (1996) Google Scholar
• Cho D. C. , Johnson E. L. , Padberg M. , Rao M. R. On the Uncapacitated Plant Location Problem I: Valid Inequalities and Facets. Mathematics of Operations Research (1983) 8 4 579 589 Link, Google Scholar
• Cho D. C. , Padberg M. , Rao M. R. On the Uncapacitated Plant Location Problem II: Facets and Lifting Theorems. Mathematics of Operations Research (1983) 8 4 590 612 Link, Google Scholar
• Cordier C. , Marchand H. , Laundy R. , Wolsey L. bc-opt: A Branch-and-Cut Code for Mixed Integer Programs. (1997) . Discussion paper 9778, CORE, Univ. Catholique de Louvain Google Scholar
• Cornuéjols G. , Thizy J.-M. Some facets of the simple plant location problem. Mathematics Programming (1982) 23 50 74 Crossref, Google Scholar
• CPLEX Optimization Inc Using the CPLEX Callable Library (1995) . http://www.cplex.com/ Google Scholar
• Dincbas M. , Van Hentenryck P. , Simonis H. , Aggoun A. , Graf T. The constraint Logic Programming Language CHIP. Fifth Generation Computer Systems, Tokyo, 1988 (1988) (Springer, Berlin) Google Scholar
• Ferreira C. On Combinatorial Optimization Problems Arising in Computer Systems Design (1993) . Ph.D. Thesis, Konrad-Zuse-Zentrum für Informationstechnik, Berlin Google Scholar
• Ferreira C. E. , Martin A. , Weismantel R. Solving Multiple Knapsack Problems by Cutting Planes. SIAM Journal on Optimization (1996) 6 3 858 877 Crossref, Google Scholar
• Gottlieb E. S. , Rao M. R. (1, sk)-Configuration Facets for the Generalized Assignment Problem. Mathematics Programming (1990) 46 53 60 Crossref, Google Scholar
• Gottlieb E. S. , Rao M. R. The Generalized Assignment Problem: Valid Inequalities and Facets. Mathematics Programming (1990) 46 31 52 Crossref, Google Scholar
• Hooker J. N. , Osorio M. A. Mixed Logical/Linear Programming. Discrete Applied Mathematics, in press (1997) Google Scholar
• Jaffar J. , Maher M. J. Constraint Logic Programming: A Survey. Journal of Logic Programming (1994) 19 20 503 581 Crossref, Google Scholar
• Johnson E. L. , Nemhauser G. L. , Savelsbergh M. W. P. Progress in Integer Programming: An Exposition. (1997) . Technical Report LEC-97-02, Georgia Institute of Technology, Atlanta, GA Google Scholar
• Jünger M. , Reinelt G. , Rinaldi G. The Traveling Salesman Problem. Handbook on Operations Research and Management Science (1995) 7 (Elsevier, Amsterdam) 225 330 Google Scholar
• Jünger M. , Reinelt G. , Thienel S. , Cook W. , Lovász L. , Seymour W. Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization. Combinatorial Optimization, Volume 20 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science (1995) (AMS, Providence, RI) 11 152 Crossref, Google Scholar
• Kasper T. A Unifying Logical Framework for Integer Linear Programming and Finite Domain Constraint Programming (1998) . Ph.D. Thesis, Fachbereich Informatik, Univ. d. Saarlandes, Saarbrücken, Germany Google Scholar
• Lassez J.-L. , McAloon K. A Canonical Form for Generalized Linear Constraints. Journal of Symbolic Computation (1992) 13 1 24 Crossref, Google Scholar
• McAloon K. , Tretkoff C. Logic, modeling, and programming. Annals Operations Research (1997) 71 335 372 Crossref, Google Scholar
• McAloon K. , Tretkoff C. , Wetzel G. , Woodruff D. L. Disjunctive Programming and Cooperating Solvers. Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search: Interfaces in Computer Science and Operations Research (1998) (Kluwer Academic Publishers, Boston, MA) 75 96 Crossref, Google Scholar
• Nemhauser G. L. , Wolsey L. A. Integer and Combinatorial Optimization (1988) (John Wiley, New York) Crossref, Google Scholar
• Padberg M. W. On the Facial Structure of Set Packing Polyhedra. Mathematical Programming (1973) 5 199 215 Crossref, Google Scholar
• Puget J. F. A C++ Implementation of CLP. (1994) . Technical report, ILOG S.A., http://www.ilog.com Google Scholar
• Revelle C. S. , Laporte G. The plant location problem: New models and research prospects. Operartions Research (1996) 4 6 863 874 Google Scholar
• Rodosek R. , Wallace M. G. , Hajian M. T. A New Approach to Integrating Mixed Integer Programming and Constraint Logic Programming. Annals of Operations Research, in press (1997) Google Scholar
• Saraswat V. A. Concurrent Constraint Programming (1993) (MIT Press, Cambridge, MA) Crossref, Google Scholar
• Schulte C. , Smolka G. , Würtz J. Finite Domain Constraint Programming in Oz—A Tutorial. (1998) . DFKI Oz Documentation Series, Deutsches Forschungszentrum für Künstliche Intelligenz, Saarbrücken, Germany Google Scholar
• Sharda R. Linear and Discrete Optimization and Modeling Software (1993) (UNICOM, Uxbridge, UK) Google Scholar
• Smolka G. , van Leeuwen J. The Oz programming model. Computer Science Today: Recent Trends and Developments (1995) (Springer, Berlin) . LNCS 1000 Crossref, Google Scholar
• Solnon C. Coopération de solveurs linéaires sur les réels pour la résolution de problémes linéaires sur les entiers. JFPLC'97 (1997) (Hermes, Paris) Google Scholar
• Tsang E. Foundations of Constraint Satisfaction (1993) (Academic Press, London) Google Scholar
• van Hentenryck P. , Deville Y. Operational Semantics of Constraint Logic Programming over Finite Domains. Programming language implementation and logic programming, PLILP'91 (1991) (Springer, Berlin) . LNCS 528 Crossref, Google Scholar
• van Hentenryck P. , Saraswat V. Strategic Directions in Constraint Programming. ACM Computing Surveys (1996) 28 4 701 726 Crossref, Google Scholar
• Wallace M. Practical Applications of Constraint Programming. Constraints (1996) 1 139 168 Crossref, Google Scholar
• Wallace M. , Novello S. , Schimpf J. Eclipse: A Platform for Constraint Logic Programming. (1997) . Technical report, IC-Parc, Imperial College, London Google Scholar
• Williams H. P. Model Building in Mathematical Programming (1993) 3rd revised ed. (John Wiley, Chichester, England) Google Scholar
• Williams H. P. Model Solving in Mathematical Programming (1993) (John Wiley, Chichester, England) Google Scholar