A new upper bound for the online square packing problem in a strip
From MaRDI portal
Publication:2012894
DOI10.1007/s10878-016-0046-4zbMath1376.90055OpenAlexW2475025173MaRDI QIDQ2012894
Jiaoliao Xiao, Guosong Yu, Yanling Mao
Publication date: 3 August 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-016-0046-4
Related Items (2)
The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ Exact solution techniques for two-dimensional cutting and packing
Cites Work
- A new lower bound for online strip packing
- A note on online hypercube packing
- Scheduling parallel jobs to minimize the makespan
- Online scheduling of parallel jobs on two machines is 2-competitive
- A note on online strip packing
- Multidimensional on-line bin packing: Algorithms and worst-case analysis
- Lower bounds for on-line two-dimensional packing algorithms
- Improved bounds for harmonic-based bin packing algorithms
- New bounds for multidimensional packing
- Improved lower bound for online strip packing
- A tight analysis of Brown-Baker-Katseff sequences for online strip packing
- Online square and cube packing
- On the online bin packing problem
- On-Line Multiple-Strip Packing
- Shelf Algorithms for Two-Dimensional Packing Problems
- A simple on-line bin-packing algorithm
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Orthogonal Packings in Two Dimensions
- On-line bin packing in linear time
- Strip Packing vs. Bin Packing
- Online Algorithm for Parallel Job Scheduling and Strip Packing
This page was built for publication: A new upper bound for the online square packing problem in a strip
