Steiner trees

Bin packing

Quadratic Assignment Problem

Vehicle routing problems: VRP web, VRPlib, and HEC

Asymmetric traveling salesman

Graph partitioning

Quantified boolean formulas

Boolean satisfiability

Constraint programming

Large graphs for shortest paths

Mixed integer programming

Train time-tabling

Survivable network design

Set cover, também aqui

Maximum independent set and minimum vertex cover

Scheduling problems

Graph coloring

Binary quadratic and max cut

Max cut

Packlib2: 2D and 3D packing problems

Edge-Weighted K-Cardinality Tree Problem

Difficult instances for clique, independent set, vertex cover and coloring

Taillard instances for job shop scheduling.

Project scheduling library.

Orienteering, OPLIB – The Orienteering Problem Library

Discrete location problems benchmarks library

Employee Scheduling Benchmark Data Sets

Weighted Tardiness Sequencing with Sequence-Dependent Setups

Beasley's OR Library

Shop scheduling

Bi-criteria benchmarks for flow-shop scheduling problems with uncertain processing times

Problem set from Railway applications

Uncapacitated facility location

Linear arrangement (Petit)

Linear ordering

Traveling Umpire Problem

Pickup and delivery problems

Bin packing with fragmentable items, Vehicle2Grid Optimization, Crew Scheduling Problem, 3D Quadratic Assignment Problem, Quadratic Assignment Problem, Vehicle Routing Problem

MINLPLib: A Library of Mixed-Integer and Continuous Nonlinear Programming Instances

vOptLib: Library of numerical instances for MultiObjective Linear Optimization problems

Stochastic server location

MIRPLib – A library of maritime inventory routing problem instances

NWLPLIB - Wireless Localization Problem Library

The Prize-Collecting Steiner Tree Problem

Minelib: A library of open-pit mining problems

General mixed-integer quadratically constrained problem instances

FAP web - A website about Frequency Assignment Problems

Capacitated Location Routing Instance Library (CLRlib)

BASBLib - A Library of Bilevel Test Problems