Bin packing with rejection revisited
From MaRDI portal
Publication:848845
DOI10.1007/S00453-008-9188-9zbMATH Open1187.68719OpenAlexW2063647078MaRDI QIDQ848845FDOQ848845
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
Cites Work
- Title not available (Why is that?)
- Techniques for scheduling with rejection
- Algorithms - ESA 2003
- Bin packing can be solved within 1+epsilon in linear time
- On the online bin packing problem
- A simple on-line bin-packing algorithm
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Title not available (Why is that?)
- Multiprocessor Scheduling with Rejection
- An improved lower bound for on-line bin packing algorithms
- Fast algorithms for bin packing
- Title not available (Why is that?)
- New Algorithms for Bin Packing
- On-line bin packing in linear time
- The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
- Approximation schemes for ordered vector packing problems
- AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items
- 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
- Title not available (Why is that?)
- Toeplitz Matrices Associated with a Semi-Infinite Laurent Series
- Linear time-approximation algorithms for bin packing
- Bin packing problems with rejection penalties and their dual problems
- A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection
- Resource augmentation for online bounded space bin packing
Cited In (14)
- Online file caching with rejection penalties
- Bin packing with general cost structures
- A fast asymptotic approximation scheme for bin packing with rejection
- Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties
- The online \(k\)-server problem with rejection
- Black and White Bin Packing Revisited
- On the generalized bin packing problem
- Title not available (Why is that?)
- Offline black and white bin packing
- Bin packing with divisible item sizes and rejection penalties
- An AFPTAS for variable sized bin packing with general activation costs
- On Variants of File Caching
- Station assignment with reallocation
- Computing and Combinatorics
Recommendations
- Bin Packing with Rejection Revisited 👍 👎
- Computing and Combinatorics 👍 👎
- Bin packing problems with rejection penalties and their dual problems 👍 👎
- A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection 👍 👎
- A fast asymptotic approximation scheme for bin packing with rejection 👍 👎
- The bin-packing problem with rejection cost and a heuristic algorithm 👍 👎
- Bin packing with divisible item sizes and rejection penalties 👍 👎
- Batched bin packing revisited 👍 👎
- Bin packing with fixed number of bins revisited 👍 👎
- Bin packing with fixed number of bins revisited 👍 👎
This page was built for publication: Bin packing with rejection revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848845)
