Worst-case analysis of fast heuristics for packing squares into a square
type: Item
instance of: scholarly article
title: Worst-case analysis of fast heuristics for packing squares into a square
zbMATH Open document ID: 0877.68039
DOI: 10.1016/0304-3975(95)00184-0
published in: Theoretical Computer Science
publication date: 1997-09-10T00:00:00Z
Mathematics Subject Classification ID: 68P20
zbMATH DE Number: 1059070
zbMATH Keywords: orthogonally packing
author: Christophe Picouleau
MaRDI profile type: Publication
full work available at URL: 0304-3975(95)00184-0
OpenAlex ID: W2093946380
cites work: Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures
cites work: A new proof for the first-fit decreasing bin-packing algorithm
cites work: The Parametric Behavior of the First-Fit Decreasing Bin Packing Algorithm
cites work: Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms
cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
cites work: A 71/60 theorem for bin packing
cites work: Tight Worst-Case Performance Bounds for Next-k-Fit Bin Packing
cites work: An improved lower bound for on-line bin packing algorithms
description: scientific article; zbMATH DE number 1059070