An open-source Java library for Constraint Programming
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)
A program to resolve the Allocation Frequency problem using two different modelisations (COP and valued CSP)
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."