The Ordered Open-End Bin-Packing Problem
Published Online:1 Oct 2003https://doi.org/10.1287/opre.51.5.759.16753
References
- Probabilistic Analysis of Packing and Partitioning Algorithms (1991) (John Wiley and Sons, New York) Google Scholar
- , Hochbaum D. Approximation algorithms for bin packing: A survey. Approximation Algorithms for NP-hard Problems (1996) (PWS Publishing Company, Boston, MA) Google Scholar
- Probabilistic analysis of algorithms for dual bin packing problems. J. Algorithms (1991) 12:189–203Crossref, Google Scholar
- Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. (1974) 3(4):299–325Crossref, Google Scholar
- Probabilistic analysis of some bin-packing algorithms. Proc. 23rd Annual Sympos. on Foundations of Comput. Sci. (1982) (IEEE Computer Society Press Los, Alamitos, CA) 107–111Google Scholar
- A bin packing algorithm with complexity O(nlog n) and performance 1 in the stochastic limit. Lecture Notes Comput. Sci. (1981) 118:369–378 http://www.springer.de/comp/lncs/Crossref, Google Scholar
- A note on an openend bin packing problem. J. Scheduling (2001) 4:201–207Crossref, Google Scholar
- A lower bound for on-line bin packing. Inform. Processing Lett. (1980) 10:76–79Crossref, Google Scholar
- Probabilistic behavior of optimal bin-packing solutions. Oper. Res. Lett. (1984) 3(3):129–135Crossref, Google Scholar
- Handbook of the Normal Distribution (1982) (Marcel Dekker, New York) Crossref, Google Scholar
- Probability Theory and Combinatorial Optimization (1997) (Society for Industrial and Applied Mathematics, Philadelphia, PA) Crossref, Google Scholar
- Lower and upper bounds for on-line bin packing and scheduling heuristics. (1995) . Ph.D. thesis, Erasmus University, Rotterdam, The NetherlandsGoogle Scholar
- On the asymptotic worst case behavior of harmonic fit. J. Algorithms (1996) 20:113–136Crossref, Google Scholar
- New algorithms for bin packing. J. ACM (1980) 27:207–227Crossref, Google Scholar

