C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation.
G. F. Cintra
Flávio Keidi Miyazawa
Yoshiko Wakabayashi
E. C. Xavier
Published in:
Eur. J. Oper. Res. (2008)
Keyphrases
</>
column generation
dynamic programming
packing problem
linear programming
cutting plane
computational complexity
integer linear programming
branch and bound
bin packing
learning algorithm
integer program
mixed integer programming
lagrangian relaxation
integer programming
linear program
np complete
special case