Find your next solver

Decision Science Leader at Toyota sharing career development tips.

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

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.

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

Course about basic modeling for discrete optimization with MiniZinc

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

PhD Operations Research | Lead Engineer @ FICO

Co-Founder + CEO at Nextmv.

Operations Research Expert | Senior Consultant @ Capgemini Invent

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

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

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.

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

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.

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.

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

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

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

The most advanced solver for nonlinear optimization.

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

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.

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

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.

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.

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

Logistics Data Scientist + Founder of Open Door Logistics.

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

Course about all things mathematical optimization: unconstrained, LP, NLP, MIP, Global optimization, Dynamic optimization, ML for optimization, and optimization under uncertainty.

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.

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

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

Updated fork from OptaPlanner

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

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