Min-sum bin packing
From MaRDI portal
Publication:721936
DOI10.1007/S10878-018-0310-XzbMATH Open1421.90125OpenAlexW2803657856WikidataQ129804482 ScholiaQ129804482MaRDI QIDQ721936FDOQ721936
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
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Approximation algorithms for combinatorial problems
- Bin packing can be solved within 1+epsilon in linear time
- On the ratio of optimal integral and fractional covers
- Approximating min sum set cover
- Database Theory - ICDT 2005
- Weighted sum coloring in batch scheduling of conflicting jobs
- Minimum Weighted Sum Bin Packing
Cited In (3)
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)