Management Science and Financial Engineering

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지
DOI QR코드

DOI QR Code

Inverse Bin-packing Number Problems: NP-Hardness and Approximation Algorithms

  • Received : 2012.07.09
  • Accepted : 2012.07.30
  • Published : 2012.11.30
Download PDF
⟨ Previous Next ⟩

Abstract

In the bin-packing problem, we deal with how to pack the items by using a minimum number of bins. In the inverse bin-packing number problem, IBPN for short, we are given a list of items and a fixed number of bins. The objective is to perturb at the minimum cost the item-size vector so that all items can be packed into the prescribed number of bins. We show that IBPN is NP-hard and provide an approximation algorithm. We also consider a variant of IBPN where the prescribed solution value should be returned by a pre-selected specific approximation algorithm.

Keywords

References

  1. Ahuja, R. K. and J. B. Orlin, "A Faster Algorithm for the Inverse Spanning Tree Problem," Journal of Algorithms 34, 1 (2000), 177-193. https://doi.org/10.1006/jagm.1999.1052
  2. Ahuja, R. K. and J. B. Orlin, Inverse optimization, Operations Research 49, 5 (2001), 771-783. https://doi.org/10.1287/opre.49.5.771.10607
  3. Ausiello, G., P. Crescenzi, P. Gambosi, V. Kann, A. Mar-chetti-Spaccame-La, and M. Protasi, "Complexity and Approximation," Springer, Berlin, 1999.
  4. Burkard, R. E., E. Gassner, and J. Hatzl, "Reverse 2-Median Problem on Trees," Discrete Applied Mathematics 156, 11 (2008), 1963-1976. https://doi.org/10.1016/j.dam.2007.04.005
  5. Burton, D. and Ph. L. Toint, "On an Instance of the Inverse Shortest Paths Problem," Mathematical Programming 53 (1992), 45-61. https://doi.org/10.1007/BF01585693
  6. Caprara, A., H. Kellerer, and U. Pferschy, "The Multiple Subset Sum Problem," SIAM Journal of Optimization 11 (1998), 308-319.
  7. Chung, Y., J. F. Culus, and M. Demange, "Inverse Booking Problems," Proceedings of the 2nd Workshop on Algorithms and Computation, Lecture Notes in Computer Science, 4921 (2008), 180-187.
  8. Chung, Y., J. F. Culus, and M. Demange, "On Inverse Chromatic Number Problems," Proceedings of the International Symposium on Combinatorial Optimization, Electronic Notes in Discrete Mathematics, 36 (2010), 1129-1136.
  9. Chung, Y. and M. Demange, "The 0-1 Inverse Maximum Stable Set Problem," Discrete Applied Mathematics 156, 13 (2008), 2501-2516. https://doi.org/10.1016/j.dam.2008.03.015
  10. Chung, Y. and M. Demange, "On Inverse Traveling Salesman Problems," 4OR-A Quarterly Journal of Operations Research 10 (2012), 193-209. https://doi.org/10.1007/s10288-011-0194-4
  11. Garey, M. R. and D. S. Johnson, "Computers and Intractability- A Guide to the Theory of NP-Completeness," Freeman, San Francisco, 1979.
  12. Heuberger, C., "Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results," Journal of Combinatorial Optimization 8, 3 (2004), 329-361. https://doi.org/10.1023/B:JOCO.0000038914.26975.9b
  13. Lenstra, J. K., A. H. G. Rinnooy Kan, and P. Brucker, "Complexity of machine scheduling Problems," Annals of Discrete Mathematics 1 (1977), 343-362. https://doi.org/10.1016/S0167-5060(08)70743-X