An Exact Algorithm for the Two-Dimensional Strip-Packing Problem

DOI10.1287/opre.1100.0833zbMath1228.90090MaRDI QIDQ3098338

Lorenza Montaletti, Marco Antonio Boschetti

Publication date: 17 November 2011

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

Full work available at URL: https://doi.org/10.1287/opre.1100.0833

zbMATH Keywords

integer programming; scheduling; branch and bound; cutting stock; trim

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C27: Combinatorial optimization

Related Items

A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem, New Lower Bound and Exact Method for the Continuous Berth Allocation Problem, The Meet-in-the-Middle Principle for Cutting and Packing Problems, Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems, A Lagrangian heuristic for sprint planning in agile software development, A skyline heuristic for the 2D rectangular packing and strip packing problems, The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem, A new search procedure for the two-dimensional orthogonal packing problem, Logic based Benders' decomposition for orthogonal stock cutting problems, An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation, The value of integrating loading and routing, Conservative scales in packing problems, Grids for cutting and packing problems: a study in the 2D knapsack problem, Exact solution techniques for two-dimensional cutting and packing, An open space based heuristic for the 2D strip packing problem with unloading constraints, Upper bounds for heuristic approaches to the strip packing problem, Combinatorial Benders' Cuts for the Strip Packing Problem, An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem