Complexity of One Packing Optimization Problem
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.
Keywordspacking optimization integer multicommodity flow labor input of exhaustive search polynomial reducibility NP-complete problems
Unable to display preview. Download preview PDF.
- 3.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).Google Scholar
- 5.R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Inc., Upper Saddle River (NJ) (1993).Google Scholar
- 8.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).Google Scholar