Bin packing with rejection revisited
From MaRDI portal
Publication:848845
DOI10.1007/s00453-008-9188-9zbMath1187.68719OpenAlexW2063647078MaRDI QIDQ848845
Publication date: 23 February 2010
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-008-9188-9
Related Items (11)
On the generalized bin packing problem ⋮ Bin packing with divisible item sizes and rejection penalties ⋮ An AFPTAS for variable sized bin packing with general activation costs ⋮ Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties ⋮ Bin packing with general cost structures ⋮ Station assignment with reallocation ⋮ On Variants of File Caching ⋮ The online \(k\)-server problem with rejection ⋮ Unnamed Item ⋮ Online file caching with rejection penalties ⋮ Offline black and white bin packing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bin packing can be solved within 1+epsilon in linear time
- A simple proof of the inequality \(\text{FFD}(L)\leq {11 \over 9} \text{OPT}(L)+1\), \(\forall L\) for the FFD bin-packing algorithm
- An improved lower bound for on-line bin packing algorithms
- Linear time-approximation algorithms for bin packing
- Fast algorithms for bin packing
- Bin packing problems with rejection penalties and their dual problems
- AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items
- On the online bin packing problem
- The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
- A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection
- A simple on-line bin-packing algorithm
- New Algorithms for Bin Packing
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Approximation schemes for ordered vector packing problems
- On-line bin packing in linear time
- Resource augmentation for online bounded space bin packing
- Techniques for scheduling with rejection
- Multiprocessor Scheduling with Rejection
- Toeplitz Matrices Associated with a Semi-Infinite Laurent Series
- Algorithms - ESA 2003
This page was built for publication: Bin packing with rejection revisited
