Bin packing approximation algorithms: Survey and classification

作者: Edward G. Coffman , János Csirik , Gábor Galambos , Silvano Martello , Daniele Vigo

DOI: 10.1007/978-1-4419-7997-1_35

关键词: Bin packing problemCombinatorial optimizationApproximation algorithmAlgorithmComputer science

摘要:

参考文章(173)
Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen, Fair versus Unrestricted Bin Packing scandinavian workshop on algorithm theory. pp. 200- 213 ,(2000) , 10.1007/3-540-44985-X_18
Rhonda L. Salt, Marc Simon Visser, Prabhu Manyem, Approximation lower bounds in online LIB bin packing and covering Journal of Automata, Languages and Combinatorics. ,vol. 8, pp. 663- 674 ,(2003) , 10.5555/998223.998233
Joseph Wun-Tat Chan, Tak-Wah Lam, Prudence W.H. Wong, Dynamic bin packing of unit fractions items international colloquium on automata languages and programming. ,vol. 409, pp. 521- 529 ,(2008) , 10.1016/J.TCS.2008.09.028
G. Galambos, G. J. Woeginger, Repacking helps in bounded space on-line bind-packing Computing. ,vol. 49, pp. 329- 338 ,(1993) , 10.1007/BF02248693
Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov, None, On-Line Algorithms for Cardinality Constrained Bin Packing Problems international symposium on algorithms and computation. pp. 695- 706 ,(2001) , 10.1007/3-540-45678-3_59
Gregory Gutin, Tommy Jensen, Anders Yeo, Batched bin packing Discrete Optimization. ,vol. 2, pp. 71- 82 ,(2005) , 10.1016/J.DISOPT.2004.11.001
Steven S. Seiden, Rob van Stee, Leah Epstein, New Bounds for Variable-Sized Online Bin Packing SIAM Journal on Computing. ,vol. 32, pp. 455- 469 ,(2003) , 10.1137/S0097539702412908
Philippe Flajolet, Wojciech Szpankowski, Analysis of algorithms Random Structures and Algorithms. ,vol. 10, pp. 1- 3 ,(2000) , 10.1002/(SICI)1098-2418(199701)10:1/2<1::AID-RSA1>3.0.CO;2-4
David C Fisher, Next-fit packs a list and its reverse into the same number of bins Operations Research Letters. ,vol. 7, pp. 291- 293 ,(1988) , 10.1016/0167-6377(88)90060-0