An Exact Algorithm for the Two-Dimensional Strip-Packing Problem
From MaRDI portal
Publication:3098338
DOI10.1287/opre.1100.0833zbMath1228.90090OpenAlexW2088086246MaRDI 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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (21)
A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints ⋮ A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem ⋮ A Lagrangian heuristic for sprint planning in agile software development ⋮ Logic based Benders' decomposition for orthogonal stock cutting problems ⋮ An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation ⋮ Combinatorial Benders' Cuts for the Strip Packing Problem ⋮ Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem ⋮ A new search procedure for the two-dimensional orthogonal packing problem ⋮ An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem ⋮ A skyline heuristic for the 2D rectangular packing and strip packing problems ⋮ Conservative scales in packing problems ⋮ The Meet-in-the-Middle Principle for Cutting and Packing Problems ⋮ Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems ⋮ The value of integrating loading and routing ⋮ Grids for cutting and packing problems: a study in the 2D knapsack problem ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem ⋮ Upper bounds for heuristic approaches to the strip packing problem ⋮ New Lower Bound and Exact Method for the Continuous Berth Allocation Problem ⋮ An open space based heuristic for the 2D strip packing problem with unloading constraints ⋮ A hybrid metaheuristic for the two-dimensional strip packing problem
This page was built for publication: An Exact Algorithm for the Two-Dimensional Strip-Packing Problem
