A simple randomized algorithm for two-dimensional strip packing
From MaRDI portal
Recommendations
- A two-phase heuristic for strip packing: Algorithm and probabilistic analysis
- Two-dimensional packing problems: a survey
- A heuristic algorithm for the non-oriented 2D rectangular strip packing problem
- An exact algorithm for the two-dimensional strip-packing problem
- A branch and bound algorithm for the strip packing problem
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
- A least wasted first heuristic algorithm for the rectangular packing problem
- A new heuristic recursive algorithm for the strip rectangular packing problem
- A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- A squeaky wheel optimisation methodology for two-dimensional strip packing
- A typology of cutting and packing problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An Improved Heuristic Recursive Strategy Based on Genetic Algorithm for the Strip Rectangular 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
- Data set generation for rectangular placement problems
- Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- Exact solution of the two-dimensional finite bin packing problem
- Exhaustive approaches to 2D rectangular perfect packings
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- On genetic algorithms for the packing of polygons
- One-dimensional heuristics adapted for two-dimensional rectangular strip packing
- Orthogonal Packings in Two Dimensions
- Packing problems
- Reactive GRASP for the strip-packing problem
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- Two-Dimensional Finite Bin-Packing Algorithms
- Two-dimensional packing problems: a survey
Cited in
(9)- An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
- Rectangle packing with a recursive pilot method
- VCS: A new heuristic function for selecting boxes in the single container loading problem
- An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
- One-dimensional heuristics adapted for two-dimensional rectangular strip packing
- A hybrid algorithm based on variable neighbourhood for the strip packing problem
- An effective shaking procedure for 2D and 3D strip packing problems
- An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem
- A squeaky wheel optimisation methodology for two-dimensional strip packing
This page was built for publication: A simple randomized algorithm for two-dimensional strip packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339530)
