A new upper bound for the online square packing problem in a strip
type: Item
instance of: scholarly article
title: A new upper bound for the online square packing problem in a strip
zbMATH Open document ID: 1376.90055
author: Guosong Yu
author: Yanling Mao
author: Jiaoliao Xiao
published in: Journal of Combinatorial Optimization
publication date: 2017-08-03T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6756030
zbMATH Keywords: strip packing
zbMATH Keywords: square packing
zbMATH Keywords: online algorithm
zbMATH Keywords: competitive ratio
MaRDI profile type: Publication
full work available at URL: s10878-016-0046-4
OpenAlex ID: W2475025173
cites work: Lower bounds for on-line two-dimensional packing algorithms
cites work: Orthogonal Packings in Two Dimensions
cites work: Shelf Algorithms for Two-Dimensional Packing Problems
cites work: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
cites work: Multidimensional on-line bin packing: Algorithms and worst-case analysis
cites work: Online square and cube packing
cites work: Strip Packing vs. Bin Packing
cites work: Improved lower bound for online strip packing
cites work: Online Algorithm for Parallel Job Scheduling and Strip Packing
cites work: Online scheduling of parallel jobs on two machines is 2-competitive
cites work: A note on online hypercube packing
cites work: Scheduling parallel jobs to minimize the makespan
cites work: A tight analysis of Brown-Baker-Katseff sequences for online strip packing
cites work: A simple on-line bin-packing algorithm
cites work: On-line bin packing in linear time
cites work: Improved bounds for harmonic-based bin packing algorithms
cites work: On the online bin packing problem
cites work: New bounds for multidimensional packing
cites work: A note on online strip packing
cites work: On-Line Multiple-Strip Packing
cites work: A new lower bound for online strip packing
DOI: 10.1007/S10878-016-0046-4
description: scientific article; zbMATH DE number 6756030