A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
From MaRDI portal
Publication:941553
DOI10.1016/J.COR.2006.08.011zbMath1157.90558OpenAlexW1983194981MaRDI QIDQ941553
Yuli Yang, Yaodong Cui, Xian Cheng, Peihua Song
Publication date: 1 September 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.08.011
Related Items (13)
Fair and square: cake-cutting in two dimensions ⋮ A block-based layer building approach for the 2D guillotine strip packing problem ⋮ A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang ⋮ A hybrid algorithm based on variable neighbourhood for the strip packing problem ⋮ An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation ⋮ An exact method for the 2D guillotine strip packing problem ⋮ A note on ``Reducing the number of binary variables in cutting stock problems ⋮ Minimum tiling of a rectangle by squares ⋮ Heuristic algorithm for a cutting stock problem in the steel bridge construction ⋮ A least wasted first heuristic algorithm for the rectangular packing problem ⋮ A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint ⋮ Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry ⋮ New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
Cites Work
- Guillotineable bin packing: A genetic approach
- Exact algorithms for the guillotine strip cutting/packing problem.
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- A review of the application of meta-heuristic algorithms to 2D strip packing problems
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
- Two-dimensional packing problems: a survey
- An effective quasi-human based heuristic for solving the rectangle packing problem
- Exhaustive approaches to 2D rectangular perfect packings
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- A new heuristic recursive algorithm for the strip rectangular packing problem
- An improved typology of cutting and packing problems
- A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
- An Exact Approach to the Strip-Packing Problem
- Approximation schemes for covering and packing problems in image processing and VLSI
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- Unnamed Item
- Unnamed Item
This page was built for publication: A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
