Online bin packing with overload cost
From MaRDI portal
Publication:831684
DOI10.1007/978-3-030-67899-9_1OpenAlexW3127764803MaRDI QIDQ831684FDOQ831684
Authors: Kelin Luo, Frits C. R. Spieksma 
Publication date: 24 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-67899-9_1
Cites Work
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Title not available (Why is that?)
- Optimal analysis of best fit bin packing
- Bin packing with general cost structures
- An AFPTAS for variable sized bin packing with general activation costs
- Bin‐packing problem with concave costs of bin utilization
- A new lower bound for classic online bin packing
- Online variable-sized bin packing
- An on-line algorithm for variable-sized bin packing
- Approximation algorithms for extensible bin packing
- Approximation algorithms for partitioning small items in unequal bins to minimize the total size
- The optimal absolute ratio for online bin packing
- An optimal online algorithm for bounded space variable-sized bin packing
- Title not available (Why is that?)
- The Ordered Open-End Bin-Packing Problem
- A new and improved algorithm for online bin packing
- Online bin packing: old algorithms and new results
- Asymptotic fully polynomial approximation schemes for variants of open-end bin packing
Cited In (2)
This page was built for publication: Online bin packing with overload cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831684)
