Abstract The application of Additive Manufacturing (AM) within industrial settings brings new
challenges to operational research. This paper provides in-depth analyses of nesting and …

Abstract Constraint Satisfaction Problems (CSP) belong to a kind of traditional NP-hard
problems with a high impact on both research and industrial domains. The goal of these …

We consider the problem of packing convex polytopes in a cuboid of minimum volume. To
describe analytically the non-overlapping constraints for convex polytopes that allow …

This research concerns the complex housing optimization problem encountered in
engineering design, where the volume in space occupied by components need to be …

In this research, we investigate the subject of path-finding. A pruned version of visibility
graph based on Candidate Vertices is formulated, followed by a new visibility check …

The paper considers the problem of packing nonconvex polyhedra into a container of
minimum volume. An exact mathematical model of the problem of packing nonconvex …

In this research, we investigate the issue of compact design that involves finding the shortest
connecting plumbing path between hydraulic components. An improved version of visibility …

Розглянуто задачу пакування неопуклих багатогранників у контейнер мінімального
об'єму. Побудовано точну математичну модель задачі пакування неопуклих …

Рассмотрена задача упаковки выпуклых многогранников в параллелепипед
минимального объема. Для аналитического описания отношений непересечения …

We consider the packing problem for convex polytopes in a cuboid of minimum volume. To
describe analytically the non-overlapping constraints for convex polytopes that allow …