Complexity of one packing optimization problem

DOI10.1007/S10559-016-9802-9zbMath1338.90484OpenAlexW2318997251MaRDI QIDQ289799

V. A. Vasyanin, O. M. Trofymchuk, V. N. Kuz'menko

Publication date: 31 May 2016

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-016-9802-9

zbMATH Keywords

NP-complete problemsinteger multicommodity flowlabor input of exhaustive searchpacking optimizationpolynomial reducibility

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (2)

Optimization algorithms for packing of small-lot correspondence in communication networks ⋮ Problem of groupage cargo routing in the multicommodity transport network with given tariffs and delivery time constraints

Cites Work

• A technique to solve packing problem for the management of perspective development of communication network nodes
• On the Complexity of Timetable and Multicommodity Flow Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity of one packing optimization problem