Thirty instances of the two-dimensional non-guillotine cutting problem
收藏NIAID Data Ecosystem2026-03-11 收录
下载链接：
https://data.mendeley.com/datasets/gmwp6fbnnd
下载链接
链接失效反馈官方服务：
资源简介：
These are 30 instances of the two-dimensional non-guillotine cutting problem,
which aims at maximizing the total value of rectangular pieces cut from a larger rectangle.
These instances were introduced in:
Amaral, A. R. S. (2000) A new mixed-integer programming model and solution approach
for the two-dimensional non-guillotine cutting problem. Technical report,
Federal University of Espırito Santo (UFES), Brazil.
Notation:
The large stock rectangle has length L and width W.
Each piece i has length l_i, width w_i and value v_i, i= 1, . . . , m.
Q_i is the maximum number of copies of piece i that can be cut.
M=∑Q_i is the maximum number of pieces which can be cut.
The format of the file is as follows:
-----------
m
L W
l_1 w_1 Q_1 v_1
.
.
l_i w_i Q_i v_i
.
.
l_m w_m Q_m v_m
-----------
The optimal solution value for each instance is provided.
创建时间：
2019-06-15
