Find your next solver

Course about advanced modeling for discrete optimization, covering topics such as debugging or predicates

Optimization Expert | Algorithm Design | Operations Research

An arcade-style TSP challenge game written for https://github.com/tunnuz/arcadetsp's 2018 Christmas Party, follow the in-game instructions.

Course about basic modeling for discrete optimization with MiniZinc

The CG:SHOP Challenge (Computational Geometry: Solving Hard Optimization Problems) is an annual competition dedicated to tackling specific, difficult geometric optimization problems. Originally established as a workshop at Computational Geometry Week (CG Week) in 2019, the Challenge provides a unique platform where the success of proposed solutions is measured based on computational performance on a set of carefully selected benchmark instances. This focus on empirical evaluation marks a shift from traditional computational geometry research, which often emphasizes theoretical approaches.

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.

An introduction to algorithms and computational complexity to solve combinatorial optimization problems

International conference about Constraint Programming

International conference about the integration of Constraint Programming, Artificial Intelligence and Operations Research

CSPLib is a library of test problems for constraint solvers.

Challenges from the Center for Discrete Mathematics and Theoretical Computer Science

Journal covering algorithmic and applied areas of discrete mathematics

Course about discrete optimization covering a wide range of optimization techniques such as Constraint Programming, Local Search or Column Generation

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.

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.

Interactive resources to learn Graph Theory.

Creator of Optimization Solvers, CEO at InsideOpt.

MiniZinc is a high-level constraint modelling language that allows you to easily express and solve discrete optimisation problems.

Challenge from Parameterized Algorithms and Computational Experiments Challenge to bridge the gap between theory and practice of algorithms

Instances for Quadratic Assignment Problems.

SNDlib is a library of data for Survivable fixed telecommunication Network Design. Its purpose is to provide data about realistic telecommunication networks (including traffic) available to the research community.

Course about solving discrete optimization problems with different techniques: Constraint Programming, Mixed Integer Programming and Local Search

Updated fork from OptaPlanner

Another game with map visualizations for the TSP.

Solve the TSP in a visual way from the Productions and Operations Management (Universitat Wein).

TSPLIB is a library of sample instances for the TSP (and related problems) from various sources and of various types.

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.