Cardinality constrained bin‐packing problems

H. Kellerer and U. Pferschy

Annals of Operations Research, 1999, vol. 92, issue 0, 335-348

Abstract: We are concerned with a variant of the classical one‐dimensionalbin‐packing problem. n items have to be packed into unit‐capacity bins such that the total number of used bins isminimized with the additional constraint that at most k items can beassigned to one bin. In 1975, Krause et al. analyzed several approximation algorithms forthis problem and showed that they all have an asymptotic worst‐case performance ratioof 2. No better algorithms have been found so far. We present a new heuristic with anasymptotic worst-case bound of 3/2 and O(n log 2 n)running time. Copyright Kluwer Academic Publishers 1999

Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018947117526 (text/html)
Access to full text is restricted to subscribers.

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:spr:annopr:v:92:y:1999:i:0:p:335-348:10.1023/a:1018947117526

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018947117526

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().