The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
DOI10.1016/J.COR.2009.05.008zbMATH Open1175.90429OpenAlexW2003153490MaRDI QIDQ732899FDOQ732899
Mutsunori Yagiura, Shinji Imahori
Publication date: 15 October 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.05.008
Recommendations
- An improved best-fit heuristic for the orthogonal strip packing problem
- An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
- A heuristic algorithm for the non-oriented 2D rectangular strip packing problem
- A new heuristic recursive algorithm for the strip rectangular packing problem
- A two-phase heuristic for strip packing: Algorithm and probabilistic analysis
Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On genetic algorithms for the packing of polygons
- An improved typology of cutting and packing problems
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- A near-optimal solution to a two-dimensional cutting stock problem
- On strip packing With rotations
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- Orthogonal Packings in Two Dimensions
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- A typology of cutting and packing problems
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem
- Title not available (Why is that?)
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- Data set generation for rectangular placement problems
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- Reactive GRASP for the strip-packing problem
- Improved local search algorithms for the rectangle packing problem with general spatial costs
Cited In (15)
- Bidirectional best-fit heuristic for orthogonal rectangular strip packing
- Exact solution techniques for two-dimensional cutting and packing
- A skyline-based heuristic for orthogonal packing rectangles in a circle
- An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem
- A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- Rectangle packing with a recursive pilot method
- An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
- Upper bounds for heuristic approaches to the strip packing problem
- An effective shaking procedure for 2D and 3D strip packing problems
- Efficient implementations of construction heuristics for the rectilinear block packing problem
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
- A squeaky wheel optimisation methodology for two-dimensional strip packing
- An improved best-fit heuristic for the orthogonal strip packing problem
- An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
This page was built for publication: The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732899)
