On a generalized bin‐packing problem

R. T. Lewis and R. G. Parker

Naval Research Logistics Quarterly, 1982, vol. 29, issue 1, 119-145

Abstract: In this paper we address a bin‐packing problem which possesses a variety of modifications of the classic theme. Among these are bin‐dependent chip weights, bin costs, and bin‐dependent penalties for unused capacity. Lagrangian relaxations are employed in the context of a branch‐and‐bound framework in order to solve the problem after which substantial computational experience is provided.

Date: 1982
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/nav.3800290112

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:navlog:v:29:y:1982:i:1:p:119-145

Access Statistics for this article

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