An open-source Java library for Constraint Programming
DDO a generic and efficient framework for MDD-based optimization.
A high-level, solver-independent, Java constraint model for constraint satisfaction problems in the integer domain.
EasyCSP is an open-source Java library for Constraint Satisfaction Programming. Supports CSPs, CSOPs, discrete object domains, int interval domains, int constraint binarization. Examples include NQueens, Sudoku. (Builds on Sourceforge)
The purpose of this library is to read XCSP files into rust constraint programming solvers.
NuCS is a Python constraint programming library for solving Constraint Satisfaction and Optimization Problems over finite domains
A program to resolve the Allocation Frequency problem using two different modelisations (COP and valued CSP)
Constraint Programming Workshop
Constraint Programming Final Project
Implementation of the Incremental and Active Clustering (IAC) framework
Combinatorial optimization project for the Multiple Couriers Problem (MCP).
Add a description, image, and links to the constraint-optimisation-problem topic page so that developers can more easily learn about it.
To associate your repository with the constraint-optimisation-problem topic, visit your repo's landing page and select "manage topics."