Average-case analysis of the bin-packing problem with general cost structures

Naval Research Logistics

Volumn 44, Issue 7, 1997, Pages 673-686

  Bramel, Julien ^a   Rhee, WanSoo T ^b   Simchi Levi, David ^c  

^a Och Spine at New York Presbyterian Hospitals   (United States)

^b OHIO STATE UNIVERSITY   (United States)

^c NORTHWESTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTIONS; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING;

BIN PACKING PROBLEM;

LOGISTICS;

EID: 0031257890     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(199710)44:7<673::AID-NAV5>3.0.CO;2-9     Document Type: Article

References (11)

1. Anily, S., Bramel, J., and Simchi-Levi, D., "Worst-Case Analysis of Heuristics for the BinPacking Problem with General Cost Structures," Operations Research, 42, 287-298 (1991).
2. Bramel, J., and Simchi-Levi, D., "A Special Class of Cost Functions for the Bin-Packing Problem with General Cost Structures," Working Paper, Columbia University, New York, 1992.
3. Coffman, E.G., Jr., and Lueker, G.S., Probabilistic Analysis of Packing and Partitioning Algorithms, Wiley, New York, 1991.
4. Frederickson, G.N., "Probabilistic Analysis for Simple-One and Two-Dimensional Bin Packing Algorithms," Information Processing Letters, 11, 156-161 (1980).
5. Gilmore, P.C., and Gomory, R.E., "A Linear Programming Approach to the Cutting Stock Problem," Operations Research, 9, 849-859 (1961).
6. Johnson, D.S., Demers, A., Ullman, J.D., Garey, M.R., and Graham, R.L., "Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms," SIAM Journal on Computing, 3, 299-325 (1974).
7. Karmarkar, N., "Probabilistic Analysis of Some Bin-Packing Algorithms," in Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982, pp. 107-111.
8. Karmarkar, N., and Karp, R.M., "An Efficient Approximation Scheme for the One-Dimensional Bin-Packing Problem," in Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982, pp. 312-320.
9. Lueker, G.S., "Bin Packing with Items Uniformly Distributed over Intervals [a, b]," in Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983, pp. 289-297.
10. Rhee, W.T., and Talagrand, M., "Martingale Inequalities and NP-Complete Problems," Mathematics of Operations Research, 12, 177-181 (1987).
11. Rhee, W.T., and Talagrand, M., "Some Distributions That Allow Perfect Packing," Journal of the ACM, 35, 564-578 (1988).