IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v50y1999i6d10.1057_palgrave.jors.2600730.html
   My bibliography  Save this article

Comparing constraint programming and mathematical programming approaches to discrete optimisation—the change problem

Author

Listed:
  • S Heipcke

    (School of Business, University of Buckingham)

Abstract

This paper is aimed at researchers and practitioners in Operational Research who are interested in the new field of Constraint Programming/Constraint Logic Programming. Due to differing terminology and problem representation they might have found it difficult to access the field. The paper focuses on discrete optimisation problems. The first part lists frequently used terms in Constraint Programming (CP), contrasting them with their counterparts in Mathematical Programming (MP). The second part explains some of the most important concepts and techniques in more detail by comparing the CP and MP implementations of a small example problem, the ‘Change Problem’. It includes an overview of the respective results. In conclusion a more generalised comparison of CP and MP techniques is given.

Suggested Citation

  • S Heipcke, 1999. "Comparing constraint programming and mathematical programming approaches to discrete optimisation—the change problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(6), pages 581-595, June.
    • Handle: RePEc:pal:jorsoc:v:50:y:1999:i:6:d:10.1057_palgrave.jors.2600730
    DOI: 10.1057/palgrave.jors.2600730
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2600730
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2600730?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Vipul Jain & Ignacio E. Grossmann, 2001. "Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 13(4), pages 258-276, November.
    2. Enayaty-Ahangar, Forough & Rainwater, Chase E. & Sharkey, Thomas C., 2019. "A Logic-based Decomposition Approach for Multi-Period Network Interdiction Models," Omega, Elsevier, vol. 87(C), pages 71-85.
    3. Robert Ashford, 2007. "Mixed integer programming: A historical perspective with Xpress-MP," Annals of Operations Research, Springer, vol. 149(1), pages 5-17, February.
    4. Gedik, Ridvan & Rainwater, Chase & Nachtmann, Heather & Pohl, Ed A., 2016. "Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals," European Journal of Operational Research, Elsevier, vol. 251(2), pages 640-650.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:jorsoc:v:50:y:1999:i:6:d:10.1057_palgrave.jors.2600730. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.