New Classes of Lower Bounds for Bin Packing Problems
暂无分享,去创建一个
[1] Sándor P. Fekete,et al. A New Exact Algorithm for General Orthogonal D-Dimensional Knapsack Problems , 1997, ESA.
[2] Paolo Toth,et al. Lower bounds and reduction procedures for the bin packing problem , 1990, Discret. Appl. Math..
[3] S. Martello,et al. Exact Solution of the Two-Dimensional Finite Bon Packing Problem , 1998 .
[4] Richard M. Karp,et al. An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[5] John E. Beasley,et al. OR-Library: Distributing Test Problems by Electronic Mail , 1990 .
[6] Shirley Dex,et al. JR 旅客販売総合システム(マルス)における運用及び管理について , 1991 .
[7] David S. Johnson,et al. Near-optimal bin packing algorithms , 1973 .
[8] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[9] Gerhard J. Woeginger,et al. Algorithms — ESA '97 , 1997, Lecture Notes in Computer Science.
[10] Lap Mui Ann Chan,et al. Worst-case analyses, linear programming and the bin-packing problem , 1998, Math. Program..
[11] Daniele Vigo,et al. The Three-Dimensional Bin Packing Problem , 2000, Oper. Res..
[12] Jeffrey D. Ullman,et al. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..
[13] Armin Scholl,et al. Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem , 1997, Comput. Oper. Res..
[14] George S. Lueker,et al. Bin packing with items uniformly distributed over intervals [a,b] , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[15] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[16] Edward G. Coffman,et al. Probabilistic analysis of packing and partitioning algorithms , 1991, Wiley-Interscience series in discrete mathematics and optimization.
[17] G. S. Lueker,et al. Bin packing can be solved within 1 + ε in linear time , 1981 .
[18] Ian P. Gent. Heuristic Solution of Open Bin Packing Problems , 1998, J. Heuristics.
[19] Edward G. Coffman,et al. Approximation algorithms for bin packing: a survey , 1996 .