New upper bounds for online strip packing
type: Item
instance of: scholarly article
title: New upper bounds for online strip packing
zbMATH Open document ID: 1387.90231
author: Guosong Yu
author: Yanling Mao
author: Jiaoliao Xiao
published in: Discrete Optimization
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 52C15
zbMATH DE Number: 6872118
zbMATH Keywords: packing
zbMATH Keywords: strip packing
zbMATH Keywords: online algorithm
zbMATH Keywords: competitive ratio
MaRDI profile type: Publication
full work available at URL: j.disopt.2016.11.004
OpenAlex ID: W2567592803
cites work: Orthogonal Packings in Two Dimensions
cites work: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
cites work: A near-optimal solution to a two-dimensional cutting stock problem
cites work: A 2.5 times optimal algorithm for packing in two dimensions
cites work: A Strip-Packing Algorithm with Absolute Performance Bound 2
cites work: Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
cites work: A \((5/3+\varepsilon)\)-approximation for strip packing
cites work: Shelf Algorithms for Two-Dimensional Packing Problems
cites work: A note on online strip packing
cites work: Online Algorithm for Parallel Job Scheduling and Strip Packing
cites work: Lower bounds for on-line two-dimensional packing algorithms
cites work: Scheduling parallel jobs to minimize the makespan
cites work: Online scheduling of parallel jobs on two machines is 2-competitive
cites work: A tight analysis of Brown-Baker-Katseff sequences for online strip packing
cites work: Improved lower bound for online strip packing
cites work: Approximate algorithms to pack rectangles into several strips
cites work: Online multiple-strip packing
cites work: Approximation Algorithms for Multiple Strip Packing
DOI: 10.1016/J.DISOPT.2016.11.004
description: scientific article; zbMATH DE number 6872118