[KSCI] Korea Science Citation Index Service

http://dx.doi.org/10.7737/MSFE.2013.19.1.025

Inverse Bin-Packing Number Problems: Polynomially Solvable Cases

Chung, Yerim (School of Business, Yonsei University)

Publication Information

Management Science and Financial Engineering / v.19, no.1, 2013 , pp. 25-28 More about this Journal

Abstract

Consider the inverse bin-packing number problem. Given a set of items and a prescribed number K of bins, the inverse bin-packing number problem, IBPN for short, is concerned with determining the minimum perturbation to the item-size vector so that all the items can be packed into K bins or less. It is known that this problem is NP-hard (Chung, 2012). In this paper, we investigate some special cases of IBPN that can be solved in polynomial time. We propose an optimal algorithm for solving the IBPN instances with two distinct item sizes and the instances with large items.

Keywords

Inverse Combinatorial Optimization; Bin-Packing Problem; Computational Complexity;

Citations & Related Records

Times Cited By KSCI : 1 (Citation Analysis)

Reference
Cited By KSCI

1	Ausiello, G., P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccame-La, and M. Protasi, Complexity and approximation (Combinatorial optimization problems and their approximability properties), Springer, Berlin, 1999.
2	Chung, Y., "Inverse bin-packing number problems: Hardness and approximation results," Management Science and Financial Engineering 18, 2 (2012), 1-4. DOI ScienceOn
3	Chung, Y., J. F. Culus, and M. Demange, "Inverse booking problems," In Proceedings of the 2nd Work-shop on Algorithms and Computation, WALCOM Lecture Notes in Computer Science, 4921 (2008), 180-187.
4	Chung, Y., S. Hong, and M. Park, "Inverse interval scheduling problems," Manuscript 2013.
5	Garey, M. R. and D. S. Johnson, Computers and Intractability-A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
6	Harvey, W., "Computing two-dimensional integer hulls," SIAM Journal on Computing 28, 6 (1999), 2285-2299. DOI
7	Heuberger, C., "Inverse combinatorial optimization: A survey on problems, methods, and Results," Journal of Combinatorial Optimization 8, 3 (2004), 329-361. DOI
8	McCormick, S. T., S. R. Smallwood, and F. C. R. Spieksma, "A polynomial algorithm for multiprocessor scheduling with two job lengths," Mathematics of Operations Research 26, 1 (2001), 31-49. DOI ScienceOn