One-dimensional heuristics adapted for two-dimensional rectangular strip packing
From MaRDI portal
Recommendations
- New heuristic and interactive approaches to 2D rectangular strip packing
- A heuristic algorithm for the non-oriented 2D rectangular strip packing problem
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
- A simple randomized algorithm for two-dimensional strip packing
Cited in
(31)- Local search of orthogonal packings using the lower bounds
- Number of bins and maximum lateness minimization in two-dimensional bin packing
- A sequential value correction heuristic for a bi-objective two-dimensional bin-packing
- New inequalities for 1D relaxations of the 2D rectangular strip packing problem
- A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- A hybrid algorithm based on variable neighbourhood for the strip packing problem
- A simple randomized algorithm for two-dimensional strip packing
- One-dimensional relaxations and LP bounds for orthogonal packing
- Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
- A heuristic for the skiving and cutting stock problem in paper and plastic film industries
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- LP bounds in various constraint programming approaches for orthogonal packing
- An effective shaking procedure for 2D and 3D strip packing problems
- An exact strip packing algorithm based on canonical forms
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
- A squeaky wheel optimisation methodology for two-dimensional strip packing
- A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
- New heuristic and interactive approaches to 2D rectangular strip packing
- A hybrid metaheuristic for the two-dimensional strip packing problem
- Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- One-dimensional stock cutting resilient against singular random defects
- A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem
- Order and static stability into the strip packing problem
- Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution
- An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
- A heuristic algorithm for the non-oriented 2D rectangular strip packing problem
- Sequential heuristic for the two-dimensional bin-packing problem
- Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns
This page was built for publication: One-dimensional heuristics adapted for two-dimensional rectangular strip packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387421)
