A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
From MaRDI portal
Recommendations
- A branch and bound algorithm for the strip packing problem
- A new heuristic recursive algorithm for the strip rectangular packing problem
- A recursive heuristic algorithm for 2D rectangular strip packing problems
- Recursive algorithm for generating layer patterns for strip packing
- A recursive algorithm for constrained two-dimensional cutting problems
Cites work
- scientific article; zbMATH DE number 994412 (Why is no real title available?)
- scientific article; zbMATH DE number 2050771 (Why is no real title available?)
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- A near-optimal solution to a two-dimensional cutting stock problem
- A new heuristic recursive algorithm for the strip rectangular packing problem
- A review of the application of meta-heuristic algorithms to 2D strip packing problems
- An effective quasi-human based heuristic for solving the rectangle packing problem
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- An exact approach to the strip-packing problem
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
- An improved typology of cutting and packing problems
- Approximation schemes for covering and packing problems in image processing and VLSI
- Exact algorithms for the guillotine strip cutting/packing problem.
- Exhaustive approaches to 2D rectangular perfect packings
- Guillotineable bin packing: A genetic approach
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- Two-dimensional packing problems: a survey
Cited in
(24)- Heuristic algorithm for a cutting stock problem in the steel bridge construction
- Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry
- Minimum tiling of a rectangle by squares
- Fair and square: cake-cutting in two dimensions
- A note on ``Reducing the number of binary variables in cutting stock problems
- scientific article; zbMATH DE number 1225305 (Why is no real title available?)
- scientific article; zbMATH DE number 4059096 (Why is no real title available?)
- A block-based layer building approach for the 2D guillotine strip packing problem
- A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands
- Heuristic search algorithm for the rectangular fixed-size guillotine bin 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 exact rectangular two-segment layout algorithm with optimal same-shape strip generation
- Orientational variable-length strip covering problem: a branch-and-price-based algorithm
- An exact method for the 2D guillotine strip packing problem
- An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- A least wasted first heuristic algorithm for the rectangular packing problem
- A branch and bound algorithm for the strip packing problem
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
- A recursive heuristic algorithm for 2D rectangular strip packing problems
- A new heuristic recursive algorithm for the strip rectangular packing problem
- Recursive algorithm for generating layer patterns for strip packing
- A parallel branch-and-bound approach to the rectangular guillotine strip cutting problem
This page was built for publication: A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q941553)
