On-line bin packing ? A restricted survey
From MaRDI portal
Publication:4845093
DOI10.1007/BF01415672zbMath0838.90102OpenAlexW2169657806MaRDI QIDQ4845093
Gerhard J. Woeginger, Gábor Galambos
Publication date: 4 September 1995
Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01415672
Related Items (10)
Sequential vector packing ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Tight performance bound of \(AFBk\) bin packing ⋮ Cutting and packing problems under uncertainty: literature review and classification framework ⋮ The bin covering with delivery problem, extended investigations for the online case ⋮ Online square packing with gravity ⋮ A new version of on-line variable-sized bin packing ⋮ NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation ⋮ NF-based algorithms for online bin packing with buffer and bounded item size ⋮ A bin packing problem with over-sized items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An on-line algorithm for variable-sized bin packing
- Best \(k\)-fit bin packing
- An on-line algorithm for multidimensional bin packing
- Next-fit packs a list and its reverse into the same number of bins
- Online variable-sized bin packing
- Online algorithms for a dual version of bin packing
- Multidimensional on-line bin packing: Algorithms and worst-case analysis
- A 2.5 times optimal algorithm for packing in two dimensions
- A lower bound for on-line bin packing
- Lower bounds for on-line two-dimensional packing algorithms
- Improved bounds for harmonic-based bin packing algorithms
- Does randomization help in on-line bin packing?
- An improved lower bound for on-line bin packing algorithms
- Repacking helps in bounded space on-line bin-packing
- A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case
- Resource constrained scheduling as generalized bin packing
- Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms
- Fast algorithms for bin packing
- On a dual version of the one-dimensional bin packing problem
- Shelf Algorithms for Two-Dimensional Packing Problems
- Variable Sized Bin Packing
- Parametric Lower Bound for On-Line Bin-Packing
- A simple on-line bin-packing algorithm
- New Algorithms for Bin Packing
- Orthogonal Packings in Two Dimensions
- A algorithm for two-dimensional packing
- On Packing Two-Dimensional Bins
- Tight Worst-Case Performance Bounds for Next-k-Fit Bin Packing
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
- Bounds for Multiprocessor Scheduling with Resource Constraints
- Multidimensional Bin Packing Algorithms
- Improved Space for Bounded-Space, On-Line Bin-Packing
- On-line bin packing in linear time
- On Certain Nonlinear Recurring Sequences
- Bounds on Multiprocessing Timing Anomalies
- The Approximation of Numbers as Sums of Reciprocals
This page was built for publication: On-line bin packing ? A restricted survey
