Abstract
The authors consider packing optimization for elements of a square matrix, which are given by positive integers, into blocks of fixed size. The problem is formulated and its combinatorial intractability is discussed. The problem is proved to be NP-complete. This is done by polynomial reduction of an NP-complete minimum-cost integer multicommodity flow problem to this problem.
Similar content being viewed by others
References
A. N. Trofimchuk and V. A. Vasyanin, “A technique to solve packing problem for the management of perspective development of communication network nodes,” Cybern. Syst. Analysis, 50, No. 4, 560–569 (2014).
A. N. Trofimchuk and V. A. Vasyanin, “Simulation of packing, distribution, and routing of small-size discrete flows in a multicommodity network,” J. Autom. Inform. Sci., 47, No. 7, 15–30 (2015).
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Series of Books in the Mathematical Sciences, W. H. Freeman (1979).
S. Even, A. Itai, and A. Shamir, “On the complexity of timetable and multicommodity flow problems,” SIAM J. Comput., 5, 691–703 (1976).
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Inc., Upper Saddle River (NJ) (1993).
C. Barnhart, C. A. Hane, and P. H. Vange, “Using branch-and-price-and-cut to solve origin destination integer multicommodity flow problems,” Oper. Research, 48, No. 2, 318–326 (2000).
C. Barnhart, N. Krishnan, and P. H. Vange, “Multicommodity flow problems,” in: C. A. Floudas and P. M. Pardalos (eds.), Encyclopedia of Optimization, Springer, New York (2009), pp. 2354–2362.
V. A. Vasyanin, “A reference matrix of confluence of flows in packing optimization problems on multicommodity networks,” Syst. Doslidzh. ta Informats. Tekhnologii, No. 3, 42–49 (2014).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 1, January–February, 2016, pp. 83–92.
Rights and permissions
About this article
Cite this article
Trofymchuk, O.M., Vasyanin, V.A. & Kuzmenko, V.N. Complexity of One Packing Optimization Problem. Cybern Syst Anal 52, 76–84 (2016). https://doi.org/10.1007/s10559-016-9802-9
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10559-016-9802-9