Approximating robust bin packing with budgeted uncertainty
From MaRDI portal
Publication:2285083
DOI10.1007/978-3-030-24766-9_6OpenAlexW2966706308MaRDI QIDQ2285083FDOQ2285083
Michael Poss, Noam Goldberg, Aniket Basu Roy, Marin Bougeret
Publication date: 16 January 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-24766-9_6
Recommendations
- Constant-ratio approximation for robust bin packing with budgeted uncertainty
- Solving robust bin-packing problems with a branch-and-price approach
- A robust APTAS for the classical bin packing problem
- A Robust APTAS for the Classical Bin Packing Problem
- Robust combinatorial optimization with knapsack uncertainty
- Improved bounds for stochastic extensible bin packing under distributional assumptions
- Product packing and stacking under uncertainty: a robust approach
- An Efficient Approximation Scheme for Variable-Sized Bin Packing
- The stochastic generalized bin packing problem
- Approximation algorithms for extensible bin packing
Cited In (3)
This page was built for publication: Approximating robust bin packing with budgeted uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2285083)