An efficient deterministic heuristic for two-dimensional rectangular packing
From MaRDI portal
Recommendations
- A heuristic algorithm for the non-oriented 2D rectangular strip packing problem
- An efficient heuristic algorithm for two-dimensional rectangular packing problem with central rectangle
- An effective quasi-human based heuristic for solving the rectangle packing problem
- Computational Science – ICCS 2005
- Two-Dimensional Finite Bin-Packing Algorithms
Cites work
- A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- A least wasted first heuristic algorithm for the rectangular packing problem
- A new heuristic recursive algorithm for the strip rectangular packing problem
- A provably efficient algorithm for dynamic storage allocation
- A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem
- A squeaky wheel optimisation methodology for two-dimensional strip packing
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem
- An Algorithm for Two-Dimensional Cutting Problems
- An Application of Bin-Packing to Multiprocessor Scheduling
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An effective quasi-human based heuristic for solving the rectangle packing problem
- An efficient placement heuristic for three-dimensional rectangular packing
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- On genetic algorithms for the packing of polygons
- Orthogonal Packings in Two Dimensions
- Reactive GRASP for the strip-packing problem
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
Cited in
(25)- Spatial scheduling optimization algorithm for block assembly in shipbuilding
- scientific article; zbMATH DE number 5911854 (Why is no real title available?)
- An open space based heuristic for the 2D strip packing problem with unloading constraints
- An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem
- Stochastic Algorithms: Foundations and Applications
- An efficient heuristic algorithm for two-dimensional rectangular packing problem with central rectangle
- VCS: A new heuristic function for selecting boxes in the single container loading problem
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
- A quasi-Newton-based floorplanner for fixed-outline floorplanning
- An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry
- Adaptive simulated annealing with greedy search for the circle bin packing problem
- A memetic algorithm to pack unequal circles into a square
- An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules
- Rectangle packing with a recursive pilot method
- An action-space-based global optimization algorithm for packing circles into a square container
- The maximum diversity assortment selection problem
- Integrated optimization of mixed cargo packing and cargo location assignment in automated storage and retrieval systems
- An effective quasi-human based heuristic for solving the rectangle packing problem
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- 4-block heuristic for the rectangle packing problem
- Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet
- Deterministic model for customized pilot manufacture production with various backplane sizes
- Dynamic reduction heuristics for the rectangle packing area minimization problem
- 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
This page was built for publication: An efficient deterministic heuristic for two-dimensional rectangular packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762123)
