Building industrial applications with constraint programming (Q2762633)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1688814
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Building industrial applications with constraint programming |
scientific article; zbMATH DE number 1688814 |
Statements
9 January 2002
0 references
0.827692985534668
0 references
0.8230942487716675
0 references
0.8230942487716675
0 references
0.8192374110221863
0 references
0.8123760223388672
0 references
Building industrial applications with constraint programming (English)
0 references
In this chapter we will give an overview of real-life applications developed with constraint logic programming. Constraint logic programming (CLP) combines declarative logic based programming with specialised constraint solving methods from artificial intelligence, Operations Research (OR) and mathematics. It allows the clear and concise expression of a wide class of combinatorial problems together with their efficient solution. In parallel with ongoing research in this field, CLP is now increasingly used to tackle real world decision making problems. In a first part of the chapter, we will briefly present the methods and tools used for CLP and describe typical application areas. We introduce the concepts of global constraints, meta-heuristics and constraint visualisation, which are central to large scale constraint solving. For the entire collection see [Zbl 0961.00024].
0 references