Constraint Programming Winter School
Topic outline
-
General
-
If you continue to work on the labs and you have questions, you can push your code in the lab so we can access it and contact us:
- Hadrien: hadrien.cambazard@grenoble-inp.fr
- Arnaud: arnaud.malapert@univ-cotedazur.fr
- Charles: charles.prudhomme@imt-atlantique.fr
-
In this tutorial, we're going to take over the choco-solver library.
Choco-solver is a constraint programming library designed to solve combinatorial problems with ease and efficiency. Developed in Java, it offers a comprehensive set of tools for modeling and solving constraint satisfaction problems (CSPs) and constraint optimization problems (COPs).
Its intuitive and flexible API allows developers to express problem constraints in a declarative manner, enabling rapid prototyping and experimentation. Choco-solver employs state-of-the-art algorithms and search strategies to efficiently explore the solution space, providing optimal or near-optimal solutions for a wide range of real-world problems.
Whether you're solving scheduling conflicts, resource allocation, or configuration problems, Choco-solver offers a reliable and scalable solution for tackling complex optimization challenges.