Find your next solver
A curated index of Operations Research resources — solvers, courses, books, datasets, communities and more. Classified by type, topic and audience.
30 resources matching
- AI for Better PlanningNewsletter
Learn more about how AI is changing businesses and how you can leverage it: Insights, tools, tips, and expert voices
- Amazon ScienceBlog
Blog with news from the Operations Research and Optimization group at Amazon
- 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).
- 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).
- CVXPYModeling language
CVXPY is an open source Python-embedded modeling language for convex optimization problems. It lets you express your problem in a natural way that follows the math, rather than in the restrictive standard form required by solvers.
- Discord: CVXPYCommunity
The CVXPY Discord community is a group of people who use the CVXPY software to solve convex optimization problems in Python
- Discord: HiGHSCommunity
The HiGHS Discord server.
- 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).
- 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.
- Gurobi blogBlog
Blog with news from Gurobi, the company behind one of the most important solvers globally
- Gurobi case studiesBlog
Use cases from Gurobi
- 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.
- 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
- 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.
- Mike Talks AINewsletter
Practical AI for business, my experience starting and selling a company, and other content.
- MIPLearnSoftware
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.
- 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.
- 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.
- OSQPSolver
The OSQP (Operator Splitting Quadratic Program) solver is a numerical optimization package for solving convex quadratic programs.
- 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.
- The Cutting PlaneGame
Learn about cutting planes in an adictive way.