Pages that link to "Item:Q1013966"
From MaRDI portal
The following pages link to A robust APTAS for the classical bin packing problem (Q1013966):
Displaying 26 items.
- Semi-on-line bin packing: a short overview and a new lower bound (Q301113) (← links)
- Robust algorithms for preemptive scheduling (Q472464) (← links)
- On-line machine covering on two machines with local migration (Q660883) (← links)
- Tightness of sensitivity and proximity bounds for integer linear programs (Q831833) (← links)
- Robust algorithms for total completion time (Q2010916) (← links)
- Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes (Q2059895) (← links)
- Online scheduling with migration on two hierarchical machines (Q2091110) (← links)
- Robust online algorithms for dynamic choosing problems (Q2117763) (← links)
- Online load balancing with general reassignment cost (Q2157902) (← links)
- Approximating robust bin packing with budgeted uncertainty (Q2285083) (← links)
- Fully dynamic bin packing revisited (Q2288188) (← links)
- Online bin covering with limited migration (Q2689369) (← links)
- Robust approximation schemes for cube packing (Q2848196) (← links)
- Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures (Q3186540) (← links)
- A Robust PTAS for Machine Covering and Packing (Q3586449) (← links)
- Online strip packing with polynomial migration (Q5002616) (← links)
- Fully-Dynamic Bin Packing with Little Repacking (Q5002726) (← links)
- A new and improved algorithm for online bin packing (Q5009562) (← links)
- Symmetry exploitation for online machine covering with bounded migration (Q5009591) (← links)
- Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty (Q5046625) (← links)
- Online Bin Covering with Limited Migration (Q5075753) (← links)
- A Robust AFPTAS for Online Bin Packing with Polynomial Migration (Q5241236) (← links)
- Bin stretching with migration on two hierarchical machines (Q6093406) (← links)
- Online load balancing on uniform machines with limited migration (Q6106523) (← links)
- Online minimization of the maximum starting time: migration helps (Q6174813) (← links)
- Tighter bounds for the harmonic bin packing algorithm (Q6586257) (← links)
