IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-540-74512-9_32.html
   My bibliography  Save this book chapter

Constraint Programming

In: Supply Chain Management and Advanced Planning

Author

Listed:
  • Robert Klein

    (University of Augsburg)

Abstract

Constraint programming (CP) represents a relatively new technique for computing feasible (and optimal) solutions to combinatorial decision problems like those typically arising in scheduling and routing (see Chaps. 10 and 12). In the mid eighties, it was developed as a computer science technique by combining concepts of Artificial Intelligence with new programming languages. In the meantime, it has received considerable attention in practice as well as in the Operations Research (OR) community, in particular, since it has successfully been included into commercial software systems (e. g. ILOG OPL Studio). The basic idea of CP consists of providing an integrated framework for formulating and solving decision problems based on a single programming language. For the latter purpose, generalized solution procedures are included within CP systems, the application of which can be controlled by the user. Hence, in contrast to classical OR techniques such as mixed integer programming, the user of CP does not only specify the decision problem to be solved but also determines how the search for corresponding feasible solutions should be performed.

Suggested Citation

  • Robert Klein, 2008. "Constraint Programming," Springer Books, in: Hartmut Stadtler & Christoph Kilger (ed.), Supply Chain Management and Advanced Planning, edition 4, chapter 31, pages 537-544, Springer.
    • Handle: RePEc:spr:sprchp:978-3-540-74512-9_32
    DOI: 10.1007/978-3-540-74512-9_32
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    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:spr:sprchp:978-3-540-74512-9_32. 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.springer.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.