Asymptotic Worst-Case Analyses for the Open Bin Packing Problem

ii

[1]  Weizhen Mao,et al.  Tight Worst-Case Performance Bounds for Next-k-Fit Bin Packing , 1993, SIAM J. Comput..

[2]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[3]  Steven S. Seiden,et al.  On the online bin packing problem , 2001, JACM.

[4]  Guochuan Zhang,et al.  On Variable-Sized Bin Packing , 2007 .

[5]  Shirley Dex,et al.  JR 旅客販売総合システム（マルス）における運用及び管理について , 1991 .

[6]  Brenda S. Baker,et al.  A New Proof for the First-Fit Decreasing Bin-Packing Algorithm , 1985, J. Algorithms.

[7]  Guochuan Zhang.  Parameterized on-line open-end bin packing , 2007, Computing.

[8]  David S. Johnson,et al.  Bounded Space On-Line Bin Packing: Best Is Better than First , 1991, SODA '91.

[9]  Chengbin Chu,et al.  Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms , 2001, SIAM J. Comput..

[10]  André van Vliet,et al.  An Improved Lower Bound for On-Line Bin Packing Algorithms , 1992, Inf. Process. Lett..

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  Micha Hofri.  A Probabilistic Analysis of the Next-Fit Bin Packing Algorithm , 1984, J. Algorithms.

[13]  Yoshiko Wakabayashi,et al.  Approximation Algorithms For The Orthogonal Z-Oriented 3-D Packing Problem , 1999 .

[14]  David S. Johnson,et al.  Near-optimal bin packing algorithms , 1973 .

[15]  Daniele Vigo,et al.  The Three-Dimensional Bin Packing Problem , 2000, Oper. Res..

[16]  Jeffrey D. Ullman,et al.  Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[17]  David Simchi-Levi,et al.  Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands , 1992, Oper. Res..

[18]  David Simchi-Levi,et al.  Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures , 1994, Oper. Res..

[19]  D. Simchi-Levi.  New worst‐case results for the bin‐packing problem , 1994 .

[20]  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).

[21]  Michael A. Langston,et al.  Analysis of a Compound bin Packing Algorithm , 1991, SIAM J. Discret. Math..

[22]  Edward G. Coffman,et al.  An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..

[23]  G. S. Lueker,et al.  Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics , 1988 .

[24]  Kathryn A. Dowsland,et al.  The Three-Dimensional Pallet Chart: An Analysis of the Factors Affecting the Set of Feasible Layouts for a Class of Two-Dimensional Packing Problems , 1984 .

[25]  Ian P. Gent.  Heuristic Solution of Open Bin Packing Problems , 1998, J. Heuristics.

[26]  Edward G. Coffman,et al.  A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing , 1981 .

[27]  Andrew Chi-Chih Yao,et al.  Resource Constrained Scheduling as Generalized Bin Packing , 1976, J. Comb. Theory A.

[28]  D. T. Lee,et al.  A simple on-line bin-packing algorithm , 1985, JACM.

[29]  Paul E. Sweeney,et al.  Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography , 1992 .

[30]  Wansoo T. Rhee,et al.  Martingale Inequalities and NP-Complete Problems , 1987, Math. Oper. Res..

[31]  Micha Hofri.  Bin Packing Heuristics , 1987 .

[32]  W. Mao.  Besk-k-Fit bin packing , 2005, Computing.

[33]  Paolo Toth,et al.  Lower bounds and reduction procedures for the bin packing problem , 1990, Discret. Appl. Math..

[34]  André van Vliet.  On the Asymptotic Worst Case Behavior of Harmonic Fit , 1996, J. Algorithms.

[35]  Errol L. Lloyd,et al.  Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps , 1993, SIAM J. Comput..

[36]  M. F.,et al.  Bibliography , 1985, Experimental Gerontology.

[37]  Michael J. Magazine,et al.  Probabilistic Analysis of Bin Packing Heuristics , 1984, Oper. Res..

[38]  S. Griffis.  EDITOR , 1997, Journal of Navigation.

[39]  Frank M. Liang.  A Lower Bound for On-Line Bin Packing , 1980, Inf. Process. Lett..

[40]  Günther R. Raidl.  A weight-coded genetic algorithm for the multiple container packing problem , 1999, SAC '99.

[41]  Andrew Lim,et al.  A New Method For The Three Dimensional Container Packing Problem , 2001, IJCAI.

[42]  David S. Johnson,et al.  Bin packing with discrete item sizes, part II: tight bounds on first fit , 1997 .

[43]  Richard W. Cuthbertson,et al.  The Logic of Logistics: Theory, Algorithms and Applications for Logistics Management , 1998, J. Oper. Res. Soc..

[44]  M. Yue.  A simple proof of the inequality FFD (L) ≤ 11/9 OPT (L) + 1, ∀L for the FFD bin-packing algorithm , 1991 .

[45]  Jian Yang,et al.  The Ordered Open-End Bin-Packing Problem , 2003, Oper. Res..

[46]  LEAH EPSTEIN,et al.  New Bounds for Variable-Sized Online Bin Packing , 2003, SIAM J. Comput..

[47]  Emanuel Falkenauer,et al.  A hybrid grouping genetic algorithm for bin packing , 1996, J. Heuristics.

[48]  János Csirik.  An on-line algorithm for variable-sized bin packing , 2004, Acta Informatica.

[49]  Lap Mui Ann Chan,et al.  Worst-case analyses, linear programming and the bin-packing problem , 1998, Math. Program..

[50]  David Simchi-Levi,et al.  A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands , 1993, Math. Oper. Res..

[51]  Wansoo T. Rhee.  Optimal Bin Packing with Items of Random Sizes , 1988, Math. Oper. Res..

[52]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[53]  J. O. Berkey,et al.  Two-Dimensional Finite Bin-Packing Algorithms , 1987 .

[54]  Lap Mui Ann Chan,et al.  Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models , 1998, Oper. Res..