A 13/12 approximation algorithm for bin packing with extendable bins
From MaRDI portal
(Redirected from Publication:293250)
Recommendations
Cites work
- scientific article; zbMATH DE number 3890754 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Bounds on Multiprocessing Timing Anomalies
- On-line approximation algorithms for scheduling tasks on identical machines with extendable working time
Cited in
(18)- State-Variable Modeling for a Class of Two-Stage Stochastic Optimization Problems
- Approximation schemes for the generalized extensible bin packing problem
- Approximation algorithms for extensible bin packing
- Combinatorial optimization problems in wireless switch design
- On-line scheduling with extendable working time on a small number of machines
- Approximation algorithms for extensible bin packing
- Approximation algorithms for partitioning small items in unequal bins to minimize the total size
- Branch and Price for Chance-Constrained Bin Packing
- A two-phase algorithm for bin stretching with stretching factor 1.5
- Scheduling jobs with normally distributed processing times on parallel machines
- Robust allocation of operating rooms: a cutting plane approach to handle lognormal case durations
- Adaptive Bin Packing with Overflow
- Improved bounds for stochastic extensible bin packing under distributional assumptions
- Applying extra-resource analysis to load balancing.
- Approximation and Online Algorithms
- Fast approximation methods for online scheduling of outpatient procedure centers
- Vector assignment schemes for asymmetric settings
- Optimal preemptive scheduling for general target functions
This page was built for publication: A 13/12 approximation algorithm for bin packing with extendable bins
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293250)
