Notes on inverse bin-packing problems

Yerim Chung, Myoung Ju Park

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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
Volume115
Issue number1
DOIs
Publication statusPublished - 2015 Jan

Fingerprint

Bin Packing Problem
Bins
Polynomials
Fully Polynomial Time Approximation Scheme
Bin Packing
L1-norm
Lp-norm
Approximation Scheme
Hardness
Polynomial time
NP-complete problem
Optimal Solution
Perturbation
Target
Approximation

All Science Journal Classification (ASJC) codes

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

Cite this

Chung, Yerim ; Park, Myoung Ju. / Notes on inverse bin-packing problems. In: Information Processing Letters. 2015 ; Vol. 115, No. 1. pp. 60-68.
@article{19358caf3f944a0ca735be5dd60bc55d,
title = "Notes on inverse bin-packing problems",
abstract = "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.",
author = "Yerim Chung and Park, {Myoung Ju}",
year = "2015",
month = "1",
doi = "10.1016/j.ipl.2014.09.005",
language = "English",
volume = "115",
pages = "60--68",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "1",

}

Notes on inverse bin-packing problems. / Chung, Yerim; Park, Myoung Ju.

In: Information Processing Letters, Vol. 115, No. 1, 01.2015, p. 60-68.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Notes on inverse bin-packing problems

AU - Chung, Yerim

AU - Park, Myoung Ju

PY - 2015/1

Y1 - 2015/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84908200332&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84908200332&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2014.09.005

DO - 10.1016/j.ipl.2014.09.005

M3 - Article

AN - SCOPUS:84908200332

VL - 115

SP - 60

EP - 68

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 1

ER -