Complexity of one packing optimization problem / Trofymchuk, / Vasyanin, / Kuzmenko. (2016)
Ukrainian

English  Cybernetics and Systems Analysis   /     Issue (2016, 52 (1))

Trofymchuk O.M., Vasyanin V.A., Kuzmenko V.N.
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. © 2016, Springer Science+Business Media New York.

Keywords: integer multicommodity flow, labor input of exhaustive search, NP-complete problems, packing optimization, polynomial reducibility, Computational complexity, Integer programming, Polynomials, Integer multicommodity flow problem, Minimum cost, Multi-commodity flow, NP Complete, Packing optimization, Polynomial reduction, Positive integers, Square matrices, Optimization


Cite:
Trofymchuk O.M., Vasyanin V.A., Kuzmenko V.N. (2016). Complexity of one packing optimization problem. Cybernetics and Systems Analysis, 52 (1), 83-92. doi: https://doi.org/10.1007/s10559-016-9802-9 http://jnas.nbuv.gov.ua/article/UJRN-0000460183 [In Russian].


 

Institute of Information Technologies of VNLU


+38 (044) 525-36-24
Ukraine, 03039, Kyiv, Holosiivskyi Ave, 3, room 209