AI constraint solver in Java to optimize the vehicle routing problem, employee rostering, task assignment, maintenance scheduling, conference scheduling and other planning problems.

The open source Solver AI for Java, Python and Kotlin to optimize scheduling and routing. Solve the vehicle routing problem, employee rostering, task assignment, maintenance scheduling and other planning problems.

An open-source Java library for Constraint Programming

Get started with Timefold quickstarts here. Optimize the vehicle routing problem, employee rostering, task assignment, maintenance scheduling and other planning problems.

Constraint Solver ACE

XCSP3 Tools in Java

Convex optimization for java and scala, built on Apache Commons Math

JMiniZinc

Programming language based on the synchronous and constraint paradigms

Object-oriented implementation of Constraint Handling Rules in modern Java

Repository for the implementation of a solution to the Network Design Problem for a modified Two Echelon Vehicle Routing Problem

Solve graph partitioning problem experimenting IP, CP (ortools) , Tabu search and GA

A high-level, solver-independent, Java constraint model for constraint satisfaction problems in the integer domain.

Car-Sequencing Problem solved with Constraint Programming approach

A Choco extension for Declarative Statistics

CCMT-CPBP is a neuro-symbolic artificial intelligence system (combining machine learning and constraint programming) that generates musical melodies based on given chords while providing more control over these melodies than the base transformer.

FAPE (Flexible Acting and Planning Environment) is a constraint-based planner for the ANML language.

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)

Automatic test generator using constraint programming

Il s'agit de trouver les solutions possible pour une matrice 3*3 dont la somme des élements de chaque ligne sont égaux, ainsi que les colones et les diagonales