Building industrial applications with constraint programming
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].
- Industrial linear optimization problems solved by constraint logic programming
- Model-based inference in CHARME.
- Constraint programming and decision making: theory and applications. Extended versions of selected papers based on the presentations at the CoProd'XX workshops 2013--2016
- Short-term scheduling of production fleets in underground mines using CP-based LNS
- Underground mine scheduling of mobile machines using constraint programming and large neighborhood search
- CLP-based approach to decision support for SCM systems
- Models for global constraint applications
This page was built for publication: Building industrial applications with constraint programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2762633)
