The solution of packing problems with pieces variable length and additional allocation constraints

DOI10.1080/02331939508844095zbMath0855.90092OpenAlexW2082451144MaRDI QIDQ4888260

Guntram Scheithauer

Publication date: 28 July 1996

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939508844095

zbMATH Keywords

branch-and-boundpackinglinear constraintscuttingone-dimensional partitioningforward state strategymixed-integer optimization models

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial aspects of packing and covering (05B40)

Related Items (1)

Cutting and Packing Problems with Placement Constraints

Cites Work

• Solving sequential interval cutting problems via dynamic programming
• Cutting aluminium coils with high length variabilities
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• Guillotine cutting of defective boards
• Modeling of packing problems

This page was built for publication: The solution of packing problems with pieces variable length and additional allocation constraints