Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem

DOI10.1007/978-3-319-42902-1_10MaRDI QIDQ4596196zbMATH OpenOpenAlexFDO

Authors Isabel Friedow, Guntram Scheithauer

Publication date 1 December 2017

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-42902-1_10

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• A two-dimensional strip cutting problem with sequencing constraint
• An exact method for the 2D guillotine strip packing problem
• An introduction to the two‐dimensional rectangular cutting and packing problem
• Exact solution techniques for two-dimensional cutting and packing
• An exact algorithm for the two-dimensional strip-packing problem
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
• Two-dimensional strip packing with unloading constraints
• New heuristic and interactive approaches to 2D rectangular strip packing
• Combinatorial Benders' cuts for the strip packing problem

Cited in

(5)

• Grids for cutting and packing problems: a study in the 2D knapsack problem
• Exact solution techniques for two-dimensional cutting and packing
• 2DPackLib: a two-dimensional cutting and packing library
• New inequalities for 1D relaxations of the 2D rectangular strip packing problem
• Solving the parallel processor scheduling and bin packing problems with contiguity constraints: mathematical models and computational studies

This page was built for publication: Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem

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