Min-Sum Bin Packing
暂无分享,去创建一个
[1] Jennifer Widom,et al. The Pipelined Set Cover Problem , 2005, ICDT.
[2] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[3] Jeffrey D. Ullman,et al. The performance of a memory allocation algorithm , 1971 .
[4] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[5] Leah Epstein,et al. Minimum Weighted Sum Bin Packing , 2007, WAOA.
[6] Gerhard J. Woeginger,et al. On-line Packing and Covering Problems , 1996, Online Algorithms.
[7] G. S. Lueker,et al. Bin packing can be solved within 1 + ε in linear time , 1981 .
[8] Wayne E. Smith. Various optimizers for single‐stage production , 1956 .
[9] László Lovász,et al. Approximating Min Sum Set Cover , 2004, Algorithmica.
[10] László Lovász,et al. On the ratio of optimal integral and fractional covers , 1975, Discret. Math..
[11] Leah Epstein,et al. Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs , 2006, Algorithmica.