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

Julien Bramel, WanSoo T. Rhee and David Simchi‐Levi

Naval Research Logistics (NRL), 1997, vol. 44, issue 7, 673-686

Abstract: 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. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 673–686, 1997

Date: 1997
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/(SICI)1520-6750(199710)44:73.0.CO;2-9

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:44:y:1997:i:7:p:673-686

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().