Imperial College Management School

Welcome to OR-Library

J E Beasley

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

These test data sets can be accessed via emailing to o.rlibrary@ic.ac.uk a message containing the name of the required file, or via ftp/WWW using the links below.

Click here to register your e-mail address with OR-Library for update information

The following list gives the available problem areas:

Assignment problem
Bin packing
Biquadratic assignment
Capacitated minimal spanning tree
Crew scheduling
Complementarity
Data envelopment analysis
Frequency assignment problem
Generalised assignment problem
Graph colouring
Graph planarisation
Ground holding
Integer programming
Linear ordering
Linear programming

Location:

Matching
Matrix decomposition
Maximum clique
Min-cut clustering
Multidimensional knapsack problem
Network flow
Nonlinear programming
Portfolio optimisation
Quadratic assignment problem
Resource constrained project scheduling
Resource constrained shortest path

Scheduling:

Set covering
Set partitioning

Steiner:


Stochastic programming
Three-dimensional packing
Time series forecasting
Timetabling

Travelling salesman problem:

Two-dimensional cutting:

Vehicle routing:

Instructions on how to use OR-Library can be found in the file paper or in the article J.E.Beasley, "OR-Library: distributing test problems by electronic mail", Journal of the Operational Research Society 41(11) (1990) pp1069-1072. 

J.E.Beasley, June 1990.
             Last update: May 1998

All the files in OR-Library are available via anonymous ftp to mscmga.ms.ic.ac.uk
The numeric equivalent of this ftp address is 155.198.66.4