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

DOI10.1080/02331939508844095MaRDI QIDQ4888260zbMATH OpenOpenAlexFDO

Authors 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-boundcuttingforward state strategylinear constraintsmixed-integer optimization modelsone-dimensional partitioningpacking

Mathematics Subject Classification ID

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

Recommendations

• Cutting and packing problems with placement constraints
• An exact algorithm for the type-constrained and variable sized bin packing problem
• Variable Sized Bin Packing
• Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution
• Cutting and packing optimization. Problems modeling and solution methods.

Cites work

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

Cited in

(3)

• Maximizing the number of mixed packages subject to variety constraints
• PACKING SHELVES WITH ITEMS THAT DIVIDE THE SHELVES' LENGTH: A CASE OF A UNIVERSAL NUMBER PARTITION PROBLEM
• Cutting and packing problems with placement constraints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4888260)