Integer linear programming models for 2-staged two-dimensional Knapsack problems

Abstract

We are given a unique rectangular stock of material S, with height H and width W , and a list of m rectangular shapes to be cut from S. Each shape’s type i (i = 1, . . . ,m) is characterized by a height h̄i, a width w̄i, a profit p̄i, and an upper bound ubi indicating the maximum number of items of type i which can be cut. We refer to the Two-Dimensional… (More)
DOI: 10.1007/s10107-002-0319-9

Topics

9 Figures and Tables

Cite this paper

@article{Lodi2003IntegerLP, title={Integer linear programming models for 2-staged two-dimensional Knapsack problems}, author={Andrea Lodi and Michele Monaci}, journal={Math. Program.}, year={2003}, volume={94}, pages={257-278} }