# OR-Library

OR-Library is a collection of test data sets for a variety of OR problems.

A full list of the test data sets available in OR-Library can be found
here.

## Constrained non-guillotine cutting

There are currently 5 data files.
These data files contain:
- the 12 test problems from Table 1 of
J.E. Beasley "An exact two-dimensional non-guillotine
cutting tree search procedure" Operations Research 33 (1985)
49-64.
- the test problems solved in the paper:
J.E. Beasley "A population heuristic for constrained two-dimensional
non-guillotine cutting" European Journal of Operational Research,
vol.156, 2004, pp601-627
The test problems are the files:
ngcutfs1, ngcutfs2, ngcutfs3, ngcutap and ngcutcon
The format of these data files is:
number of test problems
for each test problem in turn:
number of pieces (m)
length, width for the stock rectangle
for each piece i (i=1,...,m):
length, width,
minimum number of pieces of that type that can be cut
from the stock rectangle,
maximum number of pieces of that type that can be cut
from the stock rectangle,
value of the piece
Files ngcutfs1, ngcutfs2 and ngcutfs3 contain the Fekete
and Schepers problems (types I, II and III respectively)
solved in the European Journal of Operational Research paper.
Each file has 210 test problems.
File ngcutap contains 21 problems for which optimal solutions are known
and which were solved in the above European Journal of Operational Research paper.
The first 12 of these test problems correspond to the problems solved in Table 1
of the above Operations Research paper.
File ngcutcon contains 21 test problems solved in the European Journal of
Operational Research paper where the minimum number of pieces that can be
cut from the stock rectangle is sometimes > 0
The largest file is ngcutfs2 of size 1Mb (approximately)
The entire set of files is of size 3Mb (approximately).

Click here
to access these files

OTHER SOURCES

Other test problems are available
here