A branch and bound algorithm for the strip packing problem
From MaRDI portal
Publication:1017971
DOI10.1007/s00291-008-0128-5zbMath1160.90696OpenAlexW1984445840MaRDI QIDQ1017971
Ramón Alvarez-Valdés, José Manuel Tamarit, Francisco Parreño
Publication date: 13 May 2009
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-008-0128-5
Related Items (30)
A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang ⋮ A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints ⋮ Logic based Benders' decomposition for orthogonal stock cutting problems ⋮ An exact strip packing algorithm based on canonical forms ⋮ Combinatorial Benders' Cuts for the Strip Packing Problem ⋮ Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem ⋮ Triple-solution approach for the strip packing problem with two-staged patterns ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ A new search procedure for the two-dimensional orthogonal packing problem ⋮ Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts ⋮ A squeaky wheel optimisation methodology for two-dimensional strip packing ⋮ An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem ⋮ Scheduling inspired models for two-dimensional packing problems ⋮ A skyline heuristic for the 2D rectangular packing and strip packing problems ⋮ Conservative scales in packing problems ⋮ Metaheuristics for truck loading in the car production industry ⋮ Heuristic and exact algorithms for the multi-pile vehicle routing problem ⋮ The value of integrating loading and routing ⋮ LP bounds in various constraint programming approaches for orthogonal packing ⋮ Order and static stability into the strip packing problem ⋮ Grids for cutting and packing problems: a study in the 2D knapsack problem ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem ⋮ Upper bounds for heuristic approaches to the strip packing problem ⋮ A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem ⋮ One-dimensional relaxations and LP bounds for orthogonal packing ⋮ A branch-and-price algorithm for the temporal bin packing problem ⋮ Enhanced formulation for the Guillotine 2D Cutting knapsack problem
Cites Work
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- Reactive GRASP for the strip-packing problem
- The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- Two-dimensional packing problems: a survey
- Exhaustive approaches to 2D rectangular perfect packings
- An improved typology of cutting and packing problems
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- An Exact Approach to the Strip-Packing Problem
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Two-Dimensional Finite Bin-Packing Algorithms
- An Algorithm for Two-Dimensional Cutting Problems
- The Three-Dimensional Bin Packing Problem
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
This page was built for publication: A branch and bound algorithm for the strip packing problem
