A squeaky wheel optimisation methodology for two-dimensional strip packing
From MaRDI portal
Recommendations
- A simple randomized algorithm for two-dimensional strip packing
- Two-dimensional packing problems: a survey
- One-dimensional heuristics adapted for two-dimensional rectangular strip packing
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- An effective shaking procedure for 2D and 3D strip packing problems
Cites work
- scientific article; zbMATH DE number 1305705 (Why is no real title available?)
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- A branch and bound algorithm for the strip packing problem
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- A new constraint programming approach for the orthogonal 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 two-dimensional strip cutting problem with sequencing constraint
- A typology of cutting and packing problems
- An application of simulated annealing to the cutting stock 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
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Bidirectional best-fit heuristic for orthogonal rectangular strip packing
- 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
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- Lower bounds for on-line two-dimensional packing algorithms
- 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
- The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
- Two-Dimensional Finite Bin-Packing Algorithms
- Two-dimensional packing problems: a survey
Cited in
(10)- Exact solution techniques for two-dimensional cutting and packing
- A simple randomized algorithm for two-dimensional strip packing
- Peak demand minimization via sliced strip packing
- Upper bounds for heuristic approaches to the strip packing problem
- Combinatorial Benders' cuts for the strip packing problem
- An effective shaking procedure for 2D and 3D strip packing problems
- An exact strip packing algorithm based on canonical forms
- A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem
- An efficient deterministic heuristic for two-dimensional rectangular packing
- An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
This page was built for publication: A squeaky wheel optimisation methodology for two-dimensional strip packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q622159)
