Min-sum bin packing

DOI10.1007/S10878-018-0310-XMaRDI QIDQ721936zbMATH OpenOpenAlexWikidataFDO

Authors Leah Epstein, D. S. Johnson, Asaf Levin

Publication date 20 July 2018

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-018-0310-x

zbMATH Keywords

analysis of algorithmsapproximation algorithmsbin packing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Minimum Weighted Sum Bin Packing
• Bin packing with general cost structures
• Batched bin packing
• Batched bin packing revisited
• scientific article; zbMATH DE number 563208

Cites work

• Approximating min sum set cover
• Approximation algorithms for combinatorial problems
• Bin packing can be solved within 1+epsilon in linear time
• Database Theory - ICDT 2005
• Minimum Weighted Sum Bin Packing
• On the ratio of optimal integral and fractional covers
• Weighted sum coloring in batch scheduling of conflicting jobs

Cited in

(3)

• Improved analysis of two algorithms for min-weighted sum bin packing
• Minimum Weighted Sum Bin Packing
• Relations between capacity utilization, minimal bin size and bin number

This page was built for publication: Min-sum bin packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q721936)