Constraint and Integer Programming in OPL

References

  • Beale E., Forrest J. Global optimization using special ordered sets. Mathematical Programming (1976) 10:52–69CrossrefGoogle Scholar
  • Beldiceanu N., Contejean E. Introducing global constraints in CHIP. Journal of Mathematical and Computer Modelling (1994) 20:97–123CrossrefGoogle Scholar
  • Beringer H., De Backer B. Combinatorial Problem Solving in Constraint Logic Programming with Cooperating Solvers. Logic Programming: Formal Methods and Practical Applications (1994) (Elsevier Science Publishers)Google Scholar
  • Benhamou F., Older W. Applying interval arithmetic to real, integer and Boolean constraints. Journal of Logic Programming (1997) 32:1–24CrossrefGoogle Scholar
  • Berthier F. Using CHIP to support decision making. Actes du Séminaire 1988—Programmation en Logique (1988) (Trégastel, France) Google Scholar
  • Bisschop J., Meeraus A. On the development of a general algebraic modeling system in a strategic planning environment. Mathematical Programming Study (1982) 20:1–29CrossrefGoogle Scholar
  • Bockmayer A., Kasper T. Branch and infer: a unifying framework for integer and finite domain constraint programming. INFORMS Journal on Computing (1998) 10:287–300LinkGoogle Scholar
  • Borning A. The programming language aspects of ThingLab, a constraint-oriented simulation laboratory. ACM Transaction on Programming Languages and Systems (1981) 3:353–387CrossrefGoogle Scholar
  • Caseau Y., Laburthe F. Solving various weighted matching problems with constraints. Third International Conference on the Principles and Practice of Constraint Programming (CP'97) (1997) Lintz, Austria:17–31CrossrefGoogle Scholar
  • Cheng B. M. W., Lee J. H. M., Leung H. F., Leung Y. W. Speeding up constraint propagation by redundant modeling. Proceedings of the Second International Conference on Principles and Practice of Constraint Programming (CP'96) (1996) (Springer Verlag, Cambridge, MA) 104–118CrossrefGoogle Scholar
  • Colmerauer A. PROLOG II: manuel de référence et modèle théorique. (1982) . Technical report, GIA-Faculté de Sciences de Luminy, Marseilles, FranceGoogle Scholar
  • Colmerauer A. An introduction to Prolog III. Commun. ACM (1990) 28:412–418Google Scholar
  • Colmerauer A. Spécification de Prolog IV. (1996) . Technical report, Laboratoire d′informatique de Marseilles, Marseilles, FranceGoogle Scholar
  • Colmerauer A., Kanoui H., Pasero R., Roussel P. Un système de communication homme-machine en Français. (1973) . Rapport de recherche, Groupe Intelligence Artificielle, Université d′Aix-Marseilles II, Marseilles, FranceGoogle Scholar
  • Costa M. C. Persistency in maximum cardinality bipartite matching. Operations Research Letters (1994) 15:143–149CrossrefGoogle Scholar
  • de Farias I. R., Johnson E. L., Nemhauser G. L. Branch-and-cut for combinatorial optimization problems without auxiliary binary variables. Knowledge Engineering Review to appear (2001) CrossrefGoogle Scholar
  • Dincbas M., Simonis H., Van Hentenryck P. Solving the car sequencing problem in constraint logic programming. European Conference on Artificial Intelligence (ECAI-88) (1988) Munich, GermanyGoogle Scholar
  • Dincbas M., Van Hentenryck P., Simonis H., Aggoun A., Graf T., Berthier F. The constraint logic programming language CHIP. Proceedings of the International Conference on Fifth Generation Computer Systems (1988) Tokyo, JapanGoogle Scholar
  • El Sakkout H., Wallace M. Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints (2000) 5:359–388CrossrefGoogle Scholar
  • Fourer R. Solving piecewise-linear programs: experiments with a simplex approach. ORSA Journalon Computing (1992) 4:16–31LinkGoogle Scholar
  • Fourer R., Gay D., Kernighan B. W.AMPL: A Modeling Language for Mathematical Programming (1993) (The Scientific Press, San Francisco, CA) Google Scholar
  • Gervet C. Conjunto: constraint logic programming with finite set domains. Proc. of the International Symposium on Logic Programming (ILPS'94) (1994) Ithaca, NYGoogle Scholar
  • Gotlieb A., Botella B., Rueher M. A CLP framework for computing structural test data. Proceedings of the First International Conference on Computational Logic (2000) London, UKCrossrefGoogle Scholar
  • Graf T., Van Hentenryck P., Pradelles C., Zimmer L. Simulation of hybrid circuits in constraint logic programming. International Joint Conference on Artificial Intelligence (1989) Detroit, MIGoogle Scholar
  • Harvey W. D., Ginsberg M. L. Limited discrepancy search. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (1995) Montreal, CanadaGoogle Scholar
  • Heintze N. C., Michaylov S., Stuckey P. J. CLP(ℛ) and some electrical engineering problems. Proceedings of the 4th International Conference on Logic Programming (1987) (MIT Press, Melbourne, Australia) Google Scholar
  • Hoffman K., Padberg M. W. LP-based combinatorial problem solving. Annals of Operations Research (1985) 4:145–194CrossrefGoogle Scholar
  • Hooker J. N.Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction (2000) (John Wiley and Sons, New York) CrossrefGoogle Scholar
  • Hooker J. N., Ottosson G., Thornsteinsson E. S., Kim H.-J. A scheme for unifying optimization and constraint satisfaction methods. Knowledge Engineering Review to appear (2001) Google Scholar
  • Huynh T., Lassez C. A CLP(ℛ) option trading analysis system. Proceedings of the 5th International Conference on Logic Programming (1988) (MIT Press, Seattle, WA) Google Scholar
  • Jaffar J., Lassez J.-L. Constraint logic programming. POPL-87 (1987) (Munich, Germany) CrossrefGoogle Scholar
  • Jaffar J., Maher M. Constraint logic programming: a survey. Journal of Logic Programming (1994) 19/20:503–582CrossrefGoogle Scholar
  • Jain V., Grossmann I. E. Algorithms for hybrid MILP/CLP models for a class of optimization problems. INFORMS Journal on Computing (2001) 13:258–276LinkGoogle Scholar
  • Junker U., Karish S., Kohl N., Vaaben B., Fahle T., Sellman M. A framework for constraint programming based column generation. Fifth International Conference on the Principles and Practice of Constraint Programming (CP'99) (1999) Alexandria, VACrossrefGoogle Scholar
  • Kanellakis P. C., Kuper G. M., Revesz P. Z. Constraint query languages. PODS-90 (1990) (Nashville, TN)CrossrefGoogle Scholar
  • Kohn W., Nerode A., Subrhamanian V. S., Saraswat V., Hentenryck P. Van. Constraint logic programming: hybrid control and logic as linear programming. Principles and Practice of Constraint Programming (1995) (MIT Press, Cambridge, MA) 85–100Google Scholar
  • Kowalski R. Predicate logic as programming language. Proceedings of the IFIP Congress 74 (1974) 569–574Google Scholar
  • Laburthe F., Caseau Y. SALSA: a language for search algorithms. Fourth International Conference on the Principles and Practice of Constraint Programming (CP'98) (1998) Pisa, ItalyCrossrefGoogle Scholar
  • Mackworth A. K. Consistency in networks of relations. Artificial Intelligence (1977) 8:99–118CrossrefGoogle Scholar
  • Maher M. J. Logic semantics for a class of committed-choice programs. Fourth International Conference on Logic Programming (1987) Melbourne, Australia:858–876Google Scholar
  • Marriott K., Stuckey P.Programming with Constraints (1999) (The MIT Press, Cambridge, MA) Google Scholar
  • McAloon K. C. Tretkoff, Saraswat V., Hentenryck P. Van. 2LP: linear programming and logic Programming. Principles and Practice of Constraint Programming (1995) (MIT Press, Cambridge, MA) Google Scholar
  • McAloon K., Tretkoff C., Wetzel G. Sport league scheduling. In Proceedings of the 3th Ilog International Users Meeting (1997) Paris, FranceGoogle Scholar
  • Montanari U. Networks of constraints: fundamental properties and applications to picture processing. Information Science (1974) 7:95–132CrossrefGoogle Scholar
  • Nuijten W.Time and Resource Constrained Scheduling: A Constraint Satisfaction Approach (1994) . PhD thesis Department of Computer Science, Eindhoven University of Technology, Eindhoven, The NetherlandsGoogle Scholar
  • Perron L. Search procedures and parallelism in constraint programming. Fifth International Conference on the Principles and Practice of Constraint Programming (CP'99) (1999) Alexandria, VACrossrefGoogle Scholar
  • Pesant G., Gendreau M., Rousseau J.-M. GENIUS-CP: a generic single-vehicle routing algorithm. Third International Conference on the Principles and Practice of Constraint Programming (CP'97) (1997) Lintz, Austria:420–434CrossrefGoogle Scholar
  • Puget J.-F., Leconte M. Beyond the glass box: constraints as objects. Proceedings of the International Symposium on Logic Programming (ILPS-95) (1995) Portland, ORGoogle Scholar
  • Réfalo P. Tight cooperation and its application in piecewise linear optimization. In Fifth International Conference on the Principles and Practice of Constraint Programming (CP'99) (1999) Alexandria, VACrossrefGoogle 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) Seattle, Washington: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) Portland, Oregon:209–215Google Scholar
  • Régin J.-C. Sport league scheduling. INFORMS National Meeting (1998) (Montreal, Canada)Google Scholar
  • Saraswat V. A.Concurrent Constraint Programming Languages (1989) . PhD thesis Carnegie-Mellon University, Pittsburgh, PAGoogle Scholar
  • Savelbergh M. W. P. Preprocessing and probing for mixed integer programming problems. ORSA Journal of Computing (1994) 6:445–454LinkGoogle Scholar
  • Schulte C. Programming constraint inference engines. Proceedings of the Third International Conference on Principles and Practice of Constraint Programming (1997) 1330(Springer-Verlag, Linz, Austria) 519–533(October 1997)CrossrefGoogle Scholar
  • Shaw P. Using constraint programming and local search methods to solve vehicle routing problems. Fourth International Conference on the Principles and Practice of Constraint Programming (CP'98) (1998) Pisa, Italy:417–431CrossrefGoogle Scholar
  • Simonis H., Dincbas M. Using an extended prolog for digital circuit design. IEEE International Workshop on AI Applications to CAD Systems for Electronics (1987) (Munich, Germany) 165–188Google Scholar
  • Smolka G., Leeuwen Jan van. The Oz Programming Model. Computer Science Today (1995) (Springer Verlag, LNCS, No. 1000) CrossrefGoogle Scholar
  • van Emden M. H. Algorithmic power from declarative use of redundant constraints. Constraints (1999) 363–381CrossrefGoogle Scholar
  • Van Hentenryck P. A Framework for Consistency Techniques in Logic Programming. IJCAI-87 (1987a) (Milan, Italy) Google Scholar
  • Van Hentenryck P.Consistency Techniques in Logic Programming (1987b) . PhD thesis University of Namur, Namur, BelgiumGoogle Scholar
  • Van Hentenryck P.Constraint Satisfaction in Logic Programming (1989) (MIT Press, Cambridge, MA) . Logic Programming SeriesGoogle Scholar
  • Van Hentenryck P. Constraint Logic Programming. Knowledge Engineering Review (1991) 6:151–194CrossrefGoogle Scholar
  • Van Hentenryck P.Encyclopedia of Science and Technology, chapter Constraint Programming (1987) (Marcel Dekker)Google Scholar
  • Van Hentenryck P.The OPL Optimization Programming Language (1999) (MIT Press, Cambridge, MA) Google Scholar
  • Van Hentenryck P., Carillon J.-P. Generality Versus Specificity: An Experience with AI and OR Techniques. Proceedings of the American Association for Artificial Intelligence (AAAI–88) (1988) St. Paul, MNGoogle Scholar
  • Van Hentenryck P., Dincbas M. Domains in Logic Programming. AAAI-86 (1986) Philadelphia, PAGoogle Scholar
  • Van Hentenryck P., Michel L.OPL Script: Composing and Controlling Models (2000) (Springer Verlag). Lecture Note in Artificial Intelligence (LNAI 1865)Google Scholar
  • Van Hentenryck P., Michel L., Deville Y.Numerica: a Modeling Language for Global Optimization (1997) (MIT Press, Cambridge, MA) CrossrefGoogle Scholar
  • Van Hentenryck P., Michel L., Perron L., Regin J. C. Constraint Programming in OPL. Proceedings of the International Conference on the Principles and Practice of Declarative Programming (PPDP'99) (1999) Paris, FranceCrossrefGoogle Scholar
  • Van Hentenryck P., Perron L., Puget J.-F. Search and Strategies in OPL. ACM Transactions on Computational Logic (2000) 1:1–36CrossrefGoogle Scholar
  • Van Hentenryck P., Saraswat V. Strategic Directions in Constraint Programming. ACM Computing Surveys (1996) 28:701–726CrossrefGoogle Scholar
  • Van Hentenryck P., Saraswat V., Deville Y.The Design, Implementation, and Evaluation of the Constraint Language cc(FD). Constraint Programming: Basics and Trends (1995) (Springer Verlag)Google Scholar
  • Waltz D. Generating Semantic Descriptions from Drawings of Scenes with Shadows. (1972) . Technical Report AI271, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
  • Wolsey L.Integer Programming (1998) (John Wiley and Sons, New York, NY) Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.