Find your next solver
A curated index of Operations Research resources — solvers, courses, books, datasets, communities and more. Classified by type, topic and audience.
35 resources matching
- AliGorithmVideo
YouTube channel with interesting knowledge about optimization.
- Anything you can do I can do betterVideo
Prof Marco Lubbecke talks about optimization in a TED Talk.
- BARONSolver
BARON is the industry-leading solver for mixed-integer nonlinear programming (MINLP).
- Choco solverSolver
An Open-Source java library for constraint programming
- ClarabelSolver
http://clarabel.rs/ is a Rust implementation of an interior point numerical solver for convex optimization problems using a novel homogeneous embedding.
- COPTSolver
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.
- CPLEXSolver
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).
- cuOptSolver
Achieve world-record speed on large-scale problems with millions of constraints and variables—saving time and reducing costs.
- FICO XpressSolver
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).
- Free the world from wasteful scheduling with Timefold AIVideo
Solve NP-hard optimization problems with Timefold AI.
- GecodeSolver
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.
- GLPKSolver
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.
- GurobiSolver
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.
- Hands-On Mathematical Optimization with PythonBook
A gentle introduction to optimization with Python.
- HexalySolver
Heuristic-based solver with great results in complex problems
- HiGHSSolver
HiGHS is open-source software to solve linear programming (LP), mixed-integer programming (MIP), and convex quadratic programming (QP) models.
- InsideOptSolver
Optimization software that leverages machine learning to provide unparalleled performance.
- Introduction to Operations ResearchBook
An introduction to Operations Research with theory from Linear Programming to simulation, passing through Nonlinear Programming, Game Theory, Metaheuristics or Network flows, among others.
- IpoptSolver
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
- jMetalSolver
jMetal is a Java-based framework for multi-objective optimization with metaheuristics.
- KalisSolver
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.
- KNITROSolver
The most advanced solver for nonlinear optimization.
- LINGOSolver
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.
- lpsolveSolver
A Mixed Integer Linear Programming (MILP) solver.
- MathOpt: Solver Independent Modeling in Google OR-ToolsVideo
A new interface for Google OR-Tools.
- ML ain’t your only hammerVideo
Introduction to the field of mathematical optimization.
- MosekSolver
Solves your LPs, QPs, SOCPs, SDPs, and MIPs. Includes interfaces to C, C++, Java, MATLAB, .NET, Python, Julia, Rust and R.
- NevergradSolver
A gradient-free optimization platform.
- NLoptSolver
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.
- Operations Research: an introductionBook
A book covering the basics of Operations Research
- OSQPSolver
The OSQP (Operator Splitting Quadratic Program) solver is a numerical optimization package for solving convex quadratic programs.
- Pragmatic OR: Solving large scale optimization problems in fast moving environmentsVideo
Rubén Ruiz, Principal Applied Scientist at Amazon, shows how he leverages Hexaly at Amazon to solve a gigantic optimization problem that is out of the scope of other MILP solvers.
- SCIPSolver
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.
- SCSSolver
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.
- Timefold AISolver
Updated fork from OptaPlanner