 Constraint ProgrammingRobert Klein
Chapter 31 in Supply Chain Management and Advanced Planning, 2008, pp 537-544 from Springer Abstract: 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. Date: 2008 There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it. Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-74512-9_32 Ordering information: This item can be ordered from DOI: 10.1007/978-3-540-74512-9_32 Access Statistics for this chapter More chapters in Springer Books from Springer |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.