Find your next solver

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

BARON is the industry-leading solver for mixed-integer nonlinear programming (MINLP).

Learn supply chain principles through a visual simulation.

Web-based app that is intended to act as an entry point for data scientists and problem solvers who could benefit from optimization; the game teaches players why optimization is valuable and important, why it’s difficult (by showcasing the scaling and added complexity of optimization throughout round play), and why solvers and other optimization algorithms are essential in finding an optimal solution.

An Open-Source java library for constraint programming

http://clarabel.rs/ is a Rust implementation of an interior point numerical solver for convex optimization problems using a novel homogeneous embedding.

A mathematical optimization solver for large-scale optimization problems. It is independently developed by Cardinal Operations, and it includes high-performance solvers for LP, MIP, SDP, (MI)SOCP, convex (MI)QP, convex (MI)QCP and exponential cone programming.

The IBM ILOG CPLEX Optimizer solves integer programming problems, very large[3] linear programming problems using either primal or dual variants of the simplex method or the barrier interior point method, convex and non-convex quadratic programming problems, and convex quadratically constrained problems (solved via second-order cone programming, or SOCP).

Achieve world-record speed on large-scale problems with millions of constraints and variables—saving time and reducing costs.

A game to better understand how CVRP works.

The FICO Xpress optimizer is a commercial optimization solver for linear programming (LP), mixed integer linear programming (MILP), convex quadratic programming (QP), convex quadratically constrained quadratic programming (QCQP), second-order cone programming (SOCP) and their mixed integer counterparts. Xpress includes a general purpose non-linear solver, Xpress NonLinear, including a successive linear programming algorithm (SLP, first-order method), and Artelys Knitro (second-order methods).

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.

For solving large-scale linear programming (LP), mixed integer programming (MIP), and other related problems. It is a set of routines written in ANSI C and organized in the form of a callable library.

Gurobi Optimizer is a prescriptive analytics platform and a decision-making technology developed by Gurobi Optimization, LLC. The Gurobi Optimizer (often referred to as simply, “Gurobi”) is a solver, since it uses mathematical optimization to calculate the answer to a problem.

Heuristic-based solver with great results in complex problems

HiGHS is open-source software to solve linear programming (LP), mixed-integer programming (MIP), and convex quadratic programming (QP) models.

Optimization software that leverages machine learning to provide unparalleled performance.

Ipopt (Interior Point Optimizer, pronounced "Eye-Pea-Opt") is an open source software package for large-scale nonlinear optimization. It can be used to solve general nonlinear programming problems

jMetal is a Java-based framework for multi-objective optimization with metaheuristics.

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.

The most advanced solver for nonlinear optimization.

Interactive resources to learn Graph Theory.

Interactive resources to learn OR.

The TLC is a simple constrained integer program turned into a game that you can play in a classroom with Legos. In each round of the game, your team acts as a boutique woodworking company who must decide which items to build and sell to the market. The goal is to decide how many of each type of item to build to maximize profits and beat other teams, where you are constrained by how many component pieces you have available.

LINGO includes a set of built-in solvers to tackle a wide variety of problems. Unlike many modeling packages, all of the LINGO solvers are directly linked to the modeling environment.

A Mixed Integer Linear Programming (MILP) solver.

An extensible framework for solving discrete optimization problems using a combination of Mixed-Integer Linear Programming (MIP) and Machine Learning (ML). MIPLearn uses ML methods to automatically identify patterns in previously solved instances of the problem, then uses these patterns to accelerate the performance of conventional state-of-the-art MIP solvers such as CPLEX, Gurobi or XPRESS.

Solves your LPs, QPs, SOCPs, SDPs, and MIPs. Includes interfaces to C, C++, Java, MATLAB, .NET, Python, Julia, Rust and R.

A gradient-free optimization platform.

NLopt is a free/open-source library for nonlinear optimization, providing a common interface for a number of different free optimization routines available online as well as original implementations of various other algorithms.

Developed to help spark an interest for mathematics in children and young adults. I use optimization concepts in the context of real-life problems as motivation. All you need are a printer to print the pages with the instructions and a pair of scissors to cut out the game pieces.

The OSQP (Operator Splitting Quadratic Program) solver is a numerical optimization package for solving convex quadratic programs.

Seems some of us can't see a problem without wanting to take a crack at solving it. Does that sound like you? Good. Forge ahead and ponder this month's problem. We'll post a new one every month, and allow a month for you to submit solutions (we may even publish submitted answers, especially if they're correct).

A comprehensive guide to mathematical modeling with more than 140 games as case studies.

SCIP is currently one of the fastest non-commercial solvers for mixed integer programming (MIP) and mixed integer nonlinear programming (MINLP). It is also a framework for constraint integer programming and branch-cut-and-price.

SCS (Splitting Conic Solver) is a numerical optimization package for solving large-scale convex quadratic cone problems. The code is freely available on https://github.com/cvxgrp/scs. It solves primal-dual problems.

Deliver 100 barrels to the customer at the lowest cost. Select wells and refineries to choose volume flowing on pipe-lines.

Learn about cutting planes in an adictive way.

A game to play the Knapsack to learn how to solve it.

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).