The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
type: Item
instance of: scholarly article
title: The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
zbMATH Open document ID: 1175.90429
author: Shinji Imahori
author: Mutsunori Yagiura
published in: Computers \& Operations Research
publication date: 2009-10-15T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 5615440
zbMATH Keywords: cutting and packing
zbMATH Keywords: rectangular strip packing
zbMATH Keywords: best-fit heuristic
zbMATH Keywords: time complexity
zbMATH Keywords: approximation ratio
MaRDI profile type: Publication
full work available at URL: j.cor.2009.05.008
OpenAlex ID: W2003153490
cites work: Reactive GRASP for the strip-packing problem
cites work: Orthogonal Packings in Two Dimensions
cites work: A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
cites work: A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
cites work: A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem
cites work: The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
cites work: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
cites work: A typology of cutting and packing problems
cites work: Q4198056
cites work: An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
cites work: Improved local search algorithms for the rectangle packing problem with general spatial costs
cites work: On genetic algorithms for the packing of polygons
cites work: On strip packing With rotations
cites work: A near-optimal solution to a two-dimensional cutting stock problem
cites work: Q4349924
cites work: An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
cites work: Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
cites work: Q4350159
cites work: A Strip-Packing Algorithm with Absolute Performance Bound 2
cites work: Data set generation for rectangular placement problems
cites work: An improved typology of cutting and packing problems
DOI: 10.1016/J.COR.2009.05.008
description: scientific article; zbMATH DE number 5615440