Find your next solver

An Open-Source java library for constraint programming

Chuffed is a state of the art lazy clause solver designed from the ground up with lazy clause generation in mind.

Gecode is an open source C++ toolkit for developing constraint-based systems and applications. Gecode provides a constraint solver with state-of-the-art performance while being modular and extensible.

Heuristic-based solver with great results in complex problems

Huub is a Lazy Clause Generation (LCG) solver with a focus on modularity and maintainability in addition to speed. LCG solvers are a class of solvers that can be used to solve decision and optimization problems. They are characterized by their ability to dynamically add new Boolean variables and clauses to a Boolean Satisfiability (SAT) solver during the search process

An innovative constraints programming component able to solve quickly and efficiently a wide range of combinatorial problems relying on an interactive and user-friendly hybrid framework including constraint programming, mixed-integer programming and artificial intelligence.

7-day free email course to kickstart in Operations Research.

Course about all things mathematical optimization: unconstrained, LP, NLP, MIP, Global optimization, Dynamic optimization, ML for optimization, and optimization under uncertainty.

Updated fork from OptaPlanner

Uno (Unifying Nonlinear Optimization) is a C++ library that unifies methods for solving nonlinearly constrained optimization problems.

Z3 is a theorem prover from Microsoft Research.