Article:

Mhand Hifi. An improvement of Viswanathan and Bagchi's exact Algorithm for constrained two-dimensional cutting stock. Computers and Operations Research, 24:727-736, 1997

Instances defined:

A1-A5
H and HH

Instances used:

CGCUT
Herz

Results:

The instances are solved on a Data General AV8000. The time is given in seconds for the third version of the MVB-Algortihm.

Problem Container Size Box Types # Boxes Optimal Value Time
A1
( 50, 60)
20
61
2020
28.18
A2
( 60, 60)
20
53
2505
360.04
A3
( 70, 80)
20
47
5451
15.81
A4
( 90, 70)
20
35
6179
108.43
A5
( 132, 100)
20
45
12985
537.05
cgcut1
( 15, 10)
7
16
244
<1
cgcut2
( 40, 70)
10
23
2892
6.41
cgcut3
( 40, 70)
20
62
1860
27.22
H
( 127, 98)
5
18
11586
118.29