Skip to main content
SpringerLink
Log in

Constraint Programming and Operations Research: Comments from an Operations Researcher

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

This paper relates the author's personal experience with constraint programming and gives a personal assessment of the relationships between constraint programming and operations research.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Gaudin, E. (1997). “Contribution de la programmation par contraintes au transport: Définition et résolution d'un modèle complexe de gestion de flotte.” Thèse de Docteur de l'Université Paris 7, spécialité Informatique.

  • Pesant, G. and M. Gendreau. (1999). “A Constraint Programming Framework for Local Search Methods.” Journal of Heuristics 5, 255–279.

    Google Scholar 

  • Pesant, G., M. Gendreau, J.-Y. Potvin, and J.-M. Rousseau. (1998). “AnExact Algorithm for theTraveling Salesman Problem with Time Windows Using Constraint Logic Programming.” Transportation Science 32, 12–29.

    Google Scholar 

  • Pesant, G., M. Gendreau, J.-Y. Potvin, and J.-M. Rousseau. (1999). “On the Flexibility of Constraint Programming Models: From Single to Multiple Time Windows for the Traveling Salesman Problem.” European Journal of Operational Research 117, 253–263.

    Google Scholar 

  • Pesant, G., M. Gendreau, and J.-M. Rousseau. (1997). “GENIUS-CP: A Generic Single-Vehicle Routing Algorithm.” Principles and Practice of Constraint Programming: Proceedings of the Third International Conference (CP '97). pp. 420–434. Lecture Notes in Computer Science, vol. 1330.

  • Rousseau, L.-M., M. Gendreau, and G. Pesant. (1999a). “Using Constraint-Based Operators with Variable Neighborhood Search to Solve the Vehicle Routing Problem with Time Windows.” First Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Ferrara (Italy), February 25–26, 1999; also Journal of Heurstics, this issue.

  • Rousseau, L.-M., M. Gendreau, and G. Pesant. (1999b). “Une hybridation de programmation par contraintes et recherche locale pour le problème de tournées de véhicules.” Comptes rendus des Journées Francophones de Programmation Logique et Programmation par Contraintes (JFPLC'99), Lyons (France), June 1999, Hermès, pp. 145–160.

Download references

Author information

Authors and Affiliations

  1. Centre de recherche sur les transports and Département d'informatique et de recherche opérationnelle, Université de Montréal, C.P. 6128, succursale Centre-ville, Montréal, Canada, H3C 3J7

    Michel Gendreau

Authors
  1. Michel Gendreau
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gendreau, M. Constraint Programming and Operations Research: Comments from an Operations Researcher. Journal of Heuristics 8, 19–24 (2002). https://doi.org/10.1023/A:1013657516627

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1013657516627

Search

Navigation