Online bin packing with overload cost

DOI10.1007/978-3-030-67899-9_1MaRDI QIDQ831684zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

online algorithmscompetitive analysisbin packing

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 6678949 (Why is no real title available?)
• scientific article; zbMATH DE number 5761817 (Why is no real title available?)
• A new and improved algorithm for online bin packing
• A new lower bound for classic online bin packing
• An AFPTAS for variable sized bin packing with general activation costs
• An on-line algorithm for variable-sized bin packing
• An optimal online algorithm for bounded space variable-sized bin packing
• Approximation algorithms for extensible bin packing
• Approximation algorithms for partitioning small items in unequal bins to minimize the total size
• Asymptotic fully polynomial approximation schemes for variants of open-end bin packing
• Bin packing with general cost structures
• Bin‐packing problem with concave costs of bin utilization
• Online bin packing: old algorithms and new results
• Online variable-sized bin packing
• Optimal analysis of best fit bin packing
• The Ordered Open-End Bin-Packing Problem
• The optimal absolute ratio for online bin packing
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

Cited in

(2)

• scientific article; zbMATH DE number 910900 (Why is no real title available?)
• Online bin packing with delay and holding costs

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)