Find your next solver

Case studies from AIMMS

Optimization problems in businesses using AMPL

The journal publishes 24 issues a year that focus on the theoretical, practical, and computational aspects of operations research

The CVRPLIB team announces the CVRPLIB BKS Challenge, a 30-day competition aimed at finding extremely high-quality solutions for the new XL benchmark set, 100 challenging CVRP instances ranging from 1,000 to 10,000 customers.

The CG:SHOP Challenge (Computational Geometry: Solving Hard Optimization Problems) is an annual competition dedicated to tackling specific, difficult geometric optimization problems. Originally established as a workshop at Computational Geometry Week (CG Week) in 2019, the Challenge provides a unique platform where the success of proposed solutions is measured based on computational performance on a set of carefully selected benchmark instances. This focus on empirical evaluation marks a shift from traditional computational geometry research, which often emphasizes theoretical approaches.

Consortium for Mathematics and its applications

COMAP's Mathematical Contest in Modeling (MCM) and Interdisciplinary Contest in Modeling (ICM) are international contests for high school students and college undergraduates. The contests challenge teams of up to three students to analyze, model, solve, and present solution reports to an open-ended application problem. In these contests research, analytics, and applied intelligence are just as important as time management and problem selection. Are you and your team up to it?

Operations research and computers interact in many scientific fields of vital importance to our society. These include, among others, transportation, economics, investment strategy, inventory control, logistics, safety, reliability, urban planning, and ecology. Computers & Operations Research (COR) provides an international forum for the application of computers and operations research techniques to problems in these and related fields.

Customer success stories from Coupa including optimization problems

Community for Decision Management, including Machine Learning and Optimization

A track record of successful deployments in several countries across the globe from DecisionBrain

Challenges from the Center for Discrete Mathematics and Theoretical Computer Science

Journal covering algorithmic and applied areas of discrete mathematics

It is a peer-reviewed academic journal in operations research. It was founded in 1977 by the Association of European Operational Research Societies

The Resource Center of use cases done with FICO

A selection of case studies that demonstrate the diverse application areas of mathematical optimization with GAMS.

Grid Optimization challenges for electric systems

Insights from different case studies of companies using Gurobi

Success stories from different companies using Hexaly

Use cases from IBM

It is a peer-reviewed academic journal which is published six times a year by Wiley-Blackwell on behalf of the International Federation of Operational Research Societies. The editorial mission of the journal is to advance the theory and practice of Operational Research and Management Science internationally

Challenges around TSP variant with Santa Claus

The 2026 Land-Doig MIP Competition is a computational competition hosted by the 2026 Mixed Integer Programming Workshop, offering an opportunity for teams to showcase their practical and computational prowess and fostering innovation in computational MIP. It is named in honor of Ailsa H. Land and Alison G. Harcourt (née Doig), who proposed the first LP-based branch-and-bound algorithm.

It is a quarterly peer-reviewed scientific journal established in February 1976. It focuses on areas of mathematics relevant to the field of operations research such as continuous optimization, discrete optimization, game theory, machine learning, simulation methodology, and stochastic models. The journal is published by INFORMS (Institute for Operations Research and the Management Sciences)

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.

Annual challenges from the University of Lehigh

Real life examples from More Optimal

Journal about Operations Research from INFORMS

It is a bimonthly peer-reviewed academic journal covering operations research. It was established in 1981

Challenges with different optimization problems

Case studies from Optimal Dynamics

Case studies from Optimal Solutions focused on food & beverage, pharmaceuticals, airlines, and finance

Customer success stories from ORTEC

Challenge from Parameterized Algorithms and Computational Experiments Challenge to bridge the gap between theory and practice of algorithms

Bi-annual challenges from the French Operational Research (OR) and Decision Support Society. 2026: https://gitlab.com/Orange-OpenSource/network-optimization-tools/challenge-roadef-2026/-/tree/main/sprint_results

Annual challenges organized by Shell AI team.

Optimization competition organized by the Mexican Society of Operations Research (SMIO).

Business cases highlighted by The OR Society

Customer stories of companies using Timefold for planning problems

Vehicle Routing and Logistics work group from EURO