Complexity of one packing optimization problem

DOI10.1007/S10559-016-9802-9zbMATH Open1338.90484OpenAlexW2318997251MaRDI QIDQ289799FDOQ289799

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

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

Recommendations

• Packing cubes into a cube is NP-complete in the strong sense
• Packing of (0, 1)-matrices
• Publication:4725744
• Packing cubes into a cube is NP-hard in the strong sense
• Complexity results for the horizontal bar packing problem

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Complexity of Timetable and Multicommodity Flow Problems
• A technique to solve packing problem for the management of perspective development of communication network nodes

Cited In (3)

• 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
• Complexity results for the horizontal bar packing problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q289799)