OR-Library is a collection of test data sets for a variety of
problem areas. These test data sets can be accessed via emailing
to [log in to unmask] a message containing the word
info
or via ftp/WWW using the addresses given at the bottom of this
message
OR-Library currently covers the following problem areas:
Assignment, Bin packing, Biquadratic assignment,
Capacitated minimal spanning tree, Crew scheduling,
Complementarity, Data envelopment analysis,
Frequency assignment, Generalised assignment,
Graph colouring, Graph planarisation,
Ground holding, Integer programming,
Linear ordering, Linear programming,
Location (capacitated warehouse, p-hub,
p-median - uncapacitated/capacitated, uncapacitated
warehouse)
Matching, Matrix decomposition,
Maximum clique, Min-cut clustering,
Multidimensional knapsack, Network flow,
Nonlinear programming, Portfolio optimisation,
Quadratic assignment,
Resource constrained project scheduling
Resource constrained shortest path,
Scheduling (aircraft landing, flow shop, job shop, open shop),
Set covering, Set partitioning,
Steiner (Euclidean, Rectilinear, in graphs),
Stochastic programming, Three-dimensional packing,
Time series forecasting, Timetabling,
Travelling salesman (period salesman, single period)
Two-dimensional cutting (assortment problem, constrained guillotine
constrained non-guillotine, unconstrained guillotine)
Vehicle routing (fixed areas, fixed routes, multi-depot,
period routing, single period, single period with time windows,
sparse feasibility graph)
All the files in OR-Library are available via anonymous ftp to
mscmga.ms.ic.ac.uk
World Wide Web access is also available at
http://mscmga.ms.ic.ac.uk/info.html
J.E. Beasley
http://mscmga.ms.ic.ac.uk/jeb/jeb.html
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
