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
Cites work
- scientific article; zbMATH DE number 1670665 (Why is no real title available?)
- scientific article; zbMATH DE number 3890754 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 563208 (Why is no real title available?)
- A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection
- A simple on-line bin-packing algorithm
- 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
- AFPTAS results for common variants of bin packing: a new method for handling the small items
- An improved lower bound for on-line bin packing algorithms
- Approximation schemes for ordered vector packing problems
- Bin packing can be solved within 1+epsilon in linear time
- Bin packing problems with rejection penalties and their dual problems
- Fast algorithms for bin packing
- Linear time-approximation algorithms for bin packing
- Multiprocessor Scheduling with Rejection
- New Algorithms for Bin Packing
- On the online bin packing problem
- On-line bin packing in linear time
- Resource augmentation for online bounded space bin packing
- Scheduling for flow-time with admission control
- Techniques for scheduling with rejection
- The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
- Toeplitz Matrices Associated with a Semi-Infinite Laurent Series
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Cited in
(18)- Bin Packing with Rejection Revisited
- Online file caching with rejection penalties
- A fast asymptotic approximation scheme for bin packing with rejection
- Computing and Combinatorics
- Offline black and white bin packing
- Station assignment with reallocation
- On the generalized bin packing problem
- Bin packing with divisible item sizes and rejection penalties
- On variants of file caching
- Bin packing problems with rejection penalties and their dual problems
- Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties
- The online \(k\)-server problem with rejection
- Bin packing with general cost structures
- An AFPTAS for variable sized bin packing with general activation costs
- The entropy rounding method in approximation algorithms
- A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection
- Black and White Bin Packing Revisited
- The bin-packing problem with rejection cost and a heuristic algorithm
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)
