Notes on inverse bin-packing problems

Yerim Chung, Myoung Ju Park

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)


In bin-packing problems, given items need to be packed using a minimum number of bins. Inverse bin-packing number problems,IBPNfor short, assume a given set of items and number of bins. The objective is to achieve the minimum perturbation to the item-size vector so that all the items can be packed into the prescribed number of bins. In this paper, complexity status and approximation behavior for IBPN were investigated. Under the Lp-norm, p ∈{1, 2, ⋯,∞},IBPN turns out to be NP-hard in the strong sense.IBPNunder the L1-norm admits a polynomial time differential approximation scheme, and a fully polynomial time approximation scheme if a constant number of machines is provided as input. We also consider another IBPN variant where a specified feasible solution is given instead of a target bin number. The objective is to make the given solution optimal with minimum modification. We provide the hardness result for this problem.

Original languageEnglish
Pages (from-to)60-68
Number of pages9
JournalInformation Processing Letters
Issue number1
Publication statusPublished - 2015 Jan

Bibliographical note

Funding Information:
This work was supported by a grant from Kyung Hee University in 2012 ( KHU-20120561 ).

Publisher Copyright:
© 2014 Elsevier B.V. All rights reserved.

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications


Dive into the research topics of 'Notes on inverse bin-packing problems'. Together they form a unique fingerprint.

Cite this