Find your next solver

Decision Science Leader at Toyota sharing career development tips.

Operations Research Engineer at Réseau de Transport d'Électricité that shares optimization knowledge in his YouTube channel, Aligorithm.

Lead Data Scientist at Bluecrux with a newsletter about Constraint Programming.

Sales at Gurobi, shares interesting posts about Gurobi.

Blog with news from the Operations Research and Optimization group at Amazon

Associate Professor at Universidade Federal da Paraíba + Host of the “Subject to” podcast.

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.

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

Learn supply chain principles through a visual simulation.

Lead Operations Research Engineer at Trucksters with a newsletter about all things Operations Research.

PhD Operations Research | Lead Engineer @ FICO

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.

Operations Research Scientist at Amazon, shares pragmatic views about delivering value through OR.

Co-Founder + CEO at Nextmv.

Operations Research Expert | Senior Consultant @ Capgemini Invent

Lecturer || Funded Investigator || Logistics, Supply Chain and Smart Manufacturing

Ceres Solver is an open source C++ library for modeling and solving large, complicated optimization problems. It can be used to solve Non-linear Least Squares problems with bounds constraints and general unconstrained optimization problems.

Optimization Data Scientist at MaxAB, spreads the OR word through stories.

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.

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

CONOPT is a feasible path solver based on advanced active set methods, particularly suited for large and sparse models.

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.

Professor in Operations Research at Copenhagen Business School; Editor-in-Chief of TOP, the OR journal of SEIO.

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

Blog with news from one of the biggest companies in the world optimizing chip making

GCG is a generic decomposition solver for mixed-integer programs (MIPs). It automatically performs a Dantzig-Wolfe reformulation and runs a full-fledged branch-price-and-cut algorithm to solve it to optimality. Alternatively, GCG is able to automatically apply a Benders decomposition.

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.

Co-Founder + CTO at Timefold AI.

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.

Blog with news from Gurobi, the company behind one of the most important solvers globally

Use cases from Gurobi

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.

To solve a sparse symmetric system of linear equations.

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

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

VP Product Strategy & Industry Solutions

Leveraging data in Logistics and Supply Chain Management | #datainlogistics | PhD in Machine Learning | Industrial Engineer

Optimization consultant at Decide4AI sharing impactful tips on coding for OR projects.

J.D. Kelly is an Advanced Planning and Scheduling (APS) and Advanced Process Control (APC) expert in the process industries including both optimization and estimation technologies otherwise known as Advanced Production-chain Control, Optimization and Estimation (APCOE)

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

Senior Data Scientist | Machine Learning Engineer | Decision Scientist | Optmization | Operations Research | Python | SQL | SAS

Reader in Mathematics at the University of Edinburgh

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.

Sr Operations Research Analyst at Avista

Professor of Decision and Operation Technologies at Bielefeld University.

The most advanced solver for nonlinear optimization.

Professor of Industrial and Systems Engineering at the University of Wisconsin-Madison, 2023 INFORMS President.

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.

LGO is capable of determining high-quality solutions to global optimization problems that have (possibly many) locally optimal solutions. Because LGO makes only limited assumptions as to problem structure and differentiability, it can be applied in a broad range of design and operational applications.

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.

LOQO is a powerful solver for smooth constrained optimization problems, based on interior-point method applied to a sequence of quadratic approximations. Subject to the requirement that the defining functions be smooth (at the points evaluated by the algorithm), LOQO can handle a range of problems: linear or nonlinear, convex or nonconvex, constrained or unconstrained. For convex problems, LOQO finds a globally optimal solution; otherwise, it iterates from the given starting point to find a locally optimal solution.

A Mixed Integer Linear Programming (MILP) solver.

Professor of operations research at RWTH Aachen University.

Assistant Professor of Transportation Engineering @ York University | Director of Interactive-OR | Amazon Visiting Academic @ Amazon

Creator of Optimization Solvers, CEO at InsideOpt.

Principal Research Scientist | AI Planning, Reasoning, and Decision-Making Systems; Executive Council Board Member at ICAPS and at AAAI, AAAI Senior Member

Teaching and writing about all things AI, operations, and his startup experience.

MINOS is an established choice for both linear and nonlinear optimization problems. It incorporates proven methods for large-scale sparse nonlinear constraints, and its methods are especially effective for nonlinear objectives subject to linear and near-linear constraints.

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.

Blog with news about optimization of structures and processes (including logistics planning, network planning, production planning…)

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.

Senior Data Scientist at Horvath who shares case studies and mini interviews.

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

The PATH solver for MCP models is a Newton-based solver that combines a number of the most effective variations, extensions, and enhancements of this powerful technique.

PATHNLP is a solver for large nonlinear programming problems that builds on the PATH algorithm, extending it from mixed complementarity problems to general NLPs. PATHNLP is distributed through the GAMS ecosystem.

Manager, Operations Research & Data Science | Optimization Expert (Ph.D.)

Logistics Data Scientist + Founder of Open Door Logistics.

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

President of Optisol, Scheduling Specialist for High-Variety, Order-Driven Production and Resource-Constrained Projects.

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

SBB is a GAMS solver for Mixed Integer Nonlinear Programming (MINLP) models. It is based on a combination of the standard Branch and Bound (B&B) method known from Mixed Integer Linear Programming and some of the standard NLP solvers already supported by GAMS. SBB can use all GAMS NLP solvers as subsolvers but it works best with NLP solvers that can utilize a near optimal point as a starting point like Conopt, Minos, and Snopt.SBB supports all types of discrete variables supported by GAMS, including Binary, Integer, Semicont, Semiint, Sos1, and Sos2.

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.

SHOT (Supporting Hyperplane Optimization Toolkit) is a deterministic solver for mixed-integer nonlinear programming problems (MINLPs). Originally, SHOT was intended for convex MINLP problems only, but now also has functionality to solve nonconvex MINLP problems as a heuristic method without providing any guarantees of global optimality. SHOT can solve certain nonconvex problem types to global optimality as well.

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

A software package for solving large-scale optimization problems (linear and nonlinear programs). It employs a sparse SQP algorithm with limited-memory quasi-Newton approximations to the Hessian of Lagrangian. SNOPT is especially effective for nonlinear problems whose functions and gradients are expensive to evaluate.

Blog about mathematical modeling with Python and Excel

OR Scientist at American Tire Distributors. OR, Python, Interviewing Content and More.

Learn about cutting planes in an adictive way.

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

Self-employed OR Engineer at Bluebird Optimization sharing insights about the impact of optimization in businesses.

Updated fork from OptaPlanner

Mathematical Optimization Researcher, Teacher, and Manager

Another game with map visualizations for the TSP.

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

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

Blog about data structures and algorithms

Professor Emeritus, Princeton University/ Co-Founder, Optimal Dynamics, shares knowledge about sequential decision problems.

Senior Decision Scientist at Aimpoint Digital | Decision Sciences, Mathematical Modeling

Z3 is a theorem prover from Microsoft Research.

Consultant: Solving the Meta-Problem focused on Data and Supply Chains | Data Analytics, Inventory, Lean Warehouse, Process Improvement