Find your next solver

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?

CSPLib is a library of test problems for constraint solvers.

Instances for the CVRP challenge.

Community for Decision Management, including Machine Learning and Optimization

Challenges from the Center for Discrete Mathematics and Theoretical Computer Science

Grid Optimization challenges for electric systems

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.

This site provides access to a number of Operations Research problem data sets.

Annual challenges from the University of Lehigh

Challenges with different optimization problems

Instances for several interesting NP-hard problems.

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

Instances for Quadratic Assignment Problems.

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

SNDlib is a library of data for Survivable fixed telecommunication Network Design. Its purpose is to provide data about realistic telecommunication networks (including traffic) available to the research community.

OR-Library is a collection of test data sets for a variety of Operations Research (OR) problems.

TSPLIB is a library of sample instances for the TSP (and related problems) from various sources and of various types.

Vehicle Routing and Logistics work group from EURO

This web is dedicated to the study of VRP; we have compiled here a great deal of information about it for public access: technical reports, many different variants of the problem, alternative algorithms and techniques for solving it, some well-known instances of the problem, the best-so-far solutions for those instances, bibliography, related links…