Packing \(n\)-dimensional parallelepipeds with the feasibility of changing their orthogonal orientation in an \(n\)-dimensional parallelepiped

DOI10.1007/s10559-010-9260-8zbMath1305.90350OpenAlexW2077371707MaRDI QIDQ466345

A. V. Pankratov, A. V. Baranov, I. V. Grebennik, A. M. Chugay

Publication date: 27 October 2014

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

Full work available at URL: https://doi.org/10.1007/s10559-010-9260-8

zbMATH Keywords

optimizationpackingmathematical modeling\(\Phi\)-function\(n\)-dimensional parallelepipedNP-difficult problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (5)

Influence of certain transpositions on the cyclic structure of permutations ⋮ Special transpositions of permutation elements and properties of their composition ⋮ Multistage approach to solving the optimization problem of packing nonconvex polyhedra ⋮ \( \Phi \)-functions of 2D objects with boundaries being second-order curves ⋮ Generating combinatorial sets with given properties

Cites Work

• Unnamed Item
• Unnamed Item
• A review of the application of meta-heuristic algorithms to 2D strip packing problems
• An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
• New heuristic and interactive approaches to 2D rectangular strip packing

This page was built for publication: Packing \(n\)-dimensional parallelepipeds with the feasibility of changing their orthogonal orientation in an \(n\)-dimensional parallelepiped