The Role of Integer Programming Techniques in Constraint Programming's Global Constraints

References

• Ascheuer N., Fischetti M., Grötschel M. A polyhedral study of the asymmetric travelling salesman problem with time windows. Networks (2000) 36:69–79Crossref, Google Scholar
• Balas E., Hammer P. L., Johnson E. L., Korte B. H. Disjunctive programming. Discrete Optimization II, 5, Annals of Discrete Mathematics (1979) (North-Holland, Amsterdam, The Netherlands) 3–51Crossref, Google Scholar
• Baptiste P., Pape C. L., Nuijten W. Efficient operations research algorithms in constraint-based scheduling. Proceedings of International Joint Conference on Artificial Intelligence'95 (1995a) (Montreal, Quebec, Canada) Google Scholar
• Baptiste P., Pape C. L., Nuijten W. Incorporating efficient operations research algorithms in constraint-based scheduling. Proceedings of 1st Joint Workshop on Artificial Intelligence and Operational Research (1995b) Timberline Lodge, ORGoogle Scholar
• Baptiste P., Pape C. L., Nuijten W.Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems (2001) (Kluwer Academic Publishers, Boston, MA) Crossref, Google Scholar
• Beale E., Forrest J. Global optimization using special ordered sets. Mathematical Programming (1976) 10:52–69Crossref, Google Scholar
• Beldiceanu N. Global constraints as graph properties on a structured network of elementary constraints of the same type. Proceedings of the 6th International Conference CP 2000, Singapore, September 2000 (2000) (Springer-Verlag, Heidelberg, Germany) 52–66Crossref, Google Scholar
• Beldiceanu N., Contejean E. Introducing global constraints in CHIP. Mathematical and Computer Modelling (1994) 20:97–123Crossref, Google Scholar
• Belvaux G., Wolsey L. Lot-sizing problems: Modelling issues and a specialized branch-and-cut system bc-prod. (1996) . Technical Report CORE Discussion Paper 9849, Center for Operations Research and Econometrics, Universite Catholique de Louvain, Louvain, BelgiumGoogle Scholar
• Benhamou F., Older W. Applying interval arithmetic to real, integer and boolean constraints. Journal of Logic Programming (1997) 32:1–24Crossref, Google Scholar
• Berge C.Graphes et Hypergraphes (1970) (Dunod, Paris, France)Google Scholar
• Bockmayr A., Kasper T. Branch-and-infer: A unifying framework for integer and finite domain constraint programming. INFORMS Journal on Computing (1998) 10:287–300Link, Google Scholar
• Brucker P., Thiele O. A branch and bound method for the general shop problem with sequence dependent setup-times. OR Spektrum (1996) 18:145–161Crossref, Google Scholar
• Carlier J., Pinson E. A practical use of Jackson's preemptive schedule for solving the job-shop problem. Annals of Operations Research (1990) 26:269–287Crossref, Google Scholar
• Carlier J., Pinson E. Adjustment of heads and tails for the job-shop problem. European Journal of Operational Research (1994) 78:146–161Crossref, Google Scholar
• Carlier J., Pinson E. An algorithm for solving job shop scheduling. Management Science (1995) 35:164–176Link, Google Scholar
• Carpaneto G., Martello S., Toth P., Simeone B., Toth P., Gallo G., F. Maffioli, Pallottino S. Algorithms and codes for the assignment problem. Fortran Codes for Network Optimization, Annals of Operations Research (1988) 13:193–223Google Scholar
• Caseau Y., Laburthe F., Van Hentenryck P. Improved CLP scheduling with task intervals. Proceedings of the Eleventh International Conference on Logic Programming (1994) (MIT Press, Cambridge, MA) 369–383Google Scholar
• Caseau Y., Laburthe F., Naish L. Solving small TSPs with constraints. Proceedings of the 14th International Conference on Logic Programming (1997a) (MIT Press, Cambridge, MA) 316–330Crossref, Google Scholar
• Caseau Y., ℛLaburthe F. Solving various weighted matching problems with constraints. Principles and Practice of Constraint Programming, Lecture Notes in Computer Science (1997b) 1330:17–31Google Scholar
• Cheng B., Lee J., Wu J. A constraint-based nurse rostering system using a redundant modeling approach. Eighth IEEE International Conference on Tools with Artificial Intelligence (1996) November 1996Toulouse, France(IEEE Computer Society Press)140–148Crossref, Google Scholar
• Colmerauer A. An introduction to Prolog III. Communications of the ACM (1990) 33:69–91Crossref, Google Scholar
• Dechter R., Meiri I., Pearl J. Temporal constraint networks. Artificial Intelligence (1991) 49:61–95Crossref, Google Scholar
• Dincbas M., Van Hentenryck P., Simonis H., Aggoun A., Graf T., Berthier F. The Constraint Logic Programming Language CHIP. FGCS–88: Proceedings International Conference on Fifth Generation Computer Systems (1988) ICOT, Tokyo, Japan:693–702Google Scholar
• Focacci F.Solving Combinatorial Optimization Problems in Constraint Programming (2000) . PhD thesis University of Ferrara, Ferrara, ItalyGoogle Scholar
• Focacci F., Laborie P., Nuijten W. Solving scheduling problems with setup times and alternative resources. Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling, AIPS'00 (2000a) (AAAI Press, Menlo Park, CA) 92–111Google Scholar
• Focacci F., Lodi A., Milano M., Jaffar J. Cost-based domain filtering. Proceedings of the Fifth International Conference on Principles and Practice of Constraint Programming, CP'99, Lecture Notes in Computer Science (1999) 1713:189–203Google Scholar
• Focacci F., Lodi A., Milano M. Cutting planes in constraint programming: A hybrid approach. Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming, CP'00, Lecture Notes in Computer Science (2000b) 1894:187–201Google Scholar
• Freuder E. C. In pursuit of the holy grail. ACM Computing Surveys (1996) . 28 63Crossref, Google Scholar
• Guernalec M. B., Colmerauer A. Narrowing a 2n-block of sorting in o(nlogn). Proceedings of 3rd International Conference CP'97 (1997) Linz, Austria.:2–16Google Scholar
• Hooker J. N.Logic-Based Methods for Optimization (2000) (Wiley, New York, NY) Crossref, Google Scholar
• IC-ParcECLiPSe User Manual Release 5.3 (2001) (IC-Parc, Imperial College, London, UK) Google Scholar
• ILOGIlog Solver 5.0 User Manual (2000) (ILOG SA, Gentilly, France) Google Scholar
• Jaffar J., Maher M. Constraint logic programming: A survey. Journal of Logic Programming (1994) 19–20:503–582Crossref, Google Scholar
• Jaffar J., Michaylov S., Stuckey P., Yap R. The CLP(ℛ) language and system. ACM Transactions on Programming Languages and Systems (1992) 14Crossref, Google Scholar
• Junker U., Karisch S. E., Kohl N., Vaaben B., Fahle T., Sellmann M. Framework for constraint programming based column generation. Proceedings of 5th International Conference CP'99, Alexandria, VA, October 1999 (1999) (Springer-Verlag, Heidelberg, Germany) 261–274Crossref, Google Scholar
• Kasper T.A unifying logical framework for Integer Linear Programming and Finite Domain Constraint Programming (1998) . PhD thesis Fachbereich Informatick. University of Saarlandes, Saarbrücken, GermanyGoogle Scholar
• Mackworth A. Consistency in networks of relations. Journal of Artifical Intelligence (1977) 8:99–118Crossref, Google Scholar
• Michel L., Van Hentenryck P. Modeler++: A modeling layer for constraint programming libraries. Proceedings of the Third International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR-01) (2001) Wye College (Imperial College), Ashford, UKGoogle Scholar
• Nemhauser G., Wolsey L.Integer and Combinatorial Optimization (1988) (Wiley, New York, NY) Crossref, Google Scholar
• Nuijten W. P. M., Aarts E. H. L. A computational study of constraint satisfaction for multiple capacitated job shop scheduling. European Journal of Operational Research (1996) 90:269–284Crossref, Google Scholar
• Ottosson G., Thorsteinsson E. S., Hooker J. N. Mixed global constraints and inference in hybrid CLP-IP solvers. Annals of Mathematics and Artificial Intelligence, Special Issue on Large Scale Combinatorial Optimisation and Constraints (2002) 34:271–290Crossref, Google Scholar
• Padberg M., Rinaldi G. An efficient algorithm for the minimum capacity cut problem. Mathematical Programming (1990) 47:19–36Crossref, Google Scholar
• Puget J.-F., Leconte M., Lloyd J. Beyond the glass box: Constraints as objects. ILPS'95: Proceedings 5rd International Logic Programming Symposium (1995) (MIT Press, Cambridge, MA) 513–527Google Scholar
• Refalo P., Jaffar J. Tight cooperation and its application in piecewise linear optimization. Principles and Practice of Constraint Programming, CP'99, Lecture Notes in Computer Science (1999) 1713:375–389Crossref, Google Scholar
• Refalo P. Linear formulation of constraint programming models. Proceedings of the Second International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR-00) (2000a) University of Paderborn, Paderborn, GermanyGoogle Scholar
• Refalo P. Linear formulation of constraint programming models and hybrid solvers. Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming, CP'00, Lecture Notes in Computer Science (2000b) 1894:369–383Google Scholar
• Refalo P., Van Hentenryck P. CLP (ℛlin) revised. Proceedings of the Joint International Conference and Symposium on Logic Programming (JICSLP'96) (1996) Bonn, Germany:1–14Google Scholar
• Régin J.-C. A filtering algorithm for constraints of difference in CSPs. Proceedings of the Twelfth National Conference on Artificial Intelligence AAAI-94 (1994) August 1994Seattle, WA(AAAI Press, Menlo Park, CA) 362–367Google Scholar
• Régin J.-C. Generalized arc consistency for global cardinality constraint. Proceedings of the Thirteenth National Conference on Artificial Intelligence AAAI-96 (1996) 1996Portland, OR, August(AAAI Press, Menlo Park, CA) 209–215Google Scholar
• Régin J.-C., Jaffar J. Arc consistency for global cardinality constraints with costs. Principles and Practice of Constraint Programming, CP'99, Lecture Notes in Computer Science (1999) 1713:390–404Crossref, Google Scholar
• Régin J.-C. Minimization of the number of breaks in sports scheduling problems using constraint programming. DIMACS Series in Discrete Mathematics and Theoretical Computer Science (2001) 57:115–129Crossref, Google Scholar
• Régin J.-C., Rueher M. A global constraint combining a sum constraint and binary inequalities. Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming, CP'00, Lecture Notes in Computer Science (2000) 1894:384–395Google Scholar
• Rodosek R., Wallace M., Hajian M. A new approach to integrating mixed integer programming and constraint logic programming. Annals of Operational Research, Recent Advances in Combinatorial Optimization (1999) 86:63–87Crossref, Google Scholar
• Savelsbergh M. Preprocessing and probing techniques for mixed integer programming problems. ORSA Journal on Computing (1994) 6:445–454Link, Google Scholar
• Thorsteinsson E. S.Hybrid Approaches to Combinatorial Optimisation (2001) . PhD thesis Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PAGoogle Scholar
• Thorsteinsson E. S., Ottosson G. Linear relaxations and reduced-cost based propagation of continuous variable subscripts. Annals of Operations Research, Special Issue on Integration of Constraint Programming, Artificial Intelligence and Operations Research Methods (2001) . ForthcomingGoogle Scholar
• Tsang E.Foundations of Constraint Satisfaction (1993) (Academic Press, London, UK and San Diego, CA) Google Scholar
• Van Hentenryck P.Constraint Satisfaction in Logic Programming (1989) (MIT Press, Cambridge, MA) Google Scholar
• Wolsey L.Integer Programming (1998) (Wiley, New York, NY) Google Scholar
• Zhou J. A permutation-based approach for solving the job-shop problem. Constraints (1997) 2:185–213Crossref, Google Scholar