On-line bin-packing problem: maximizing the number of unused bins

Bernard Kouakou (), Marc Demange () and Eric Soutif ()
Additional contact information
Bernard Kouakou: Centre d'Economie de la Sorbonne
Marc Demange: ESSEC, SID department
Eric Soutif: CEDRIC, CNAM

Cahiers de la Maison des Sciences Economiques from Université Panthéon-Sorbonne (Paris 1)

Abstract: In this paper, we study the on-line version of the bin-packing problem. We analyze the approximation behaviour of an on-line bin-packing algorithm under an approximation criterion called differential ratio. We are interested in two types of results: the differential competitivity ratio guaranteed by the on-line algorithm and hardness results that account for the difficulty of the problem and for the quality of the algorithm developed to solve it. In its off-line version, the bin-packing problem, BP, is better approximated in differential framework than in standard one. Our objective is to determine if or not such result exists for the on-line version of BP

Keywords: On-line algorithm; bin-packing problem; competitivity ratio (search for similar items in EconPapers)
Pages: 17 pages
Date: 2005-12
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://halshs.archives-ouvertes.fr/halshs-00115660 (application/pdf)

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:mse:wpsorb:b06038

Access Statistics for this paper

More papers in Cahiers de la Maison des Sciences Economiques from Université Panthéon-Sorbonne (Paris 1) Contact information at EDIRC.
Bibliographic data for series maintained by Lucie Label ().