Min-sum bin packing

DOI10.1007/s10878-018-0310-xzbMath1421.90125OpenAlexW2803657856WikidataQ129804482 ScholiaQ129804482MaRDI QIDQ721936

David S. Johnson, Leah Epstein, 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)

Related Items (2)

Improved analysis of two algorithms for min-weighted sum bin packing ⋮ Minimum Weighted Sum Bin Packing

Cites Work

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

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