| Article ID: | iaor19981415 |
| Country: | United States |
| Volume: | 44 |
| Issue: | 7 |
| Start Page Number: | 673 |
| End Page Number: | 686 |
| Publication Date: | Oct 1997 |
| Journal: | Naval Research Logistics |
| Authors: | Simchi-Levi David, Rhee WanSoo T., Bramel Julien |
| Keywords: | bin packing |
We consider a version of the famous bin-packing problem where the cost of a bin is a concave function of the number of items in the bin. We analyze the problem from an average-case point of view and develop techniques to determine the asymptotic optimal solution value for a variety of functions. We also describe heuristic techniques that are asymptotically optimal.