Optimization of 3D objects layout into a multiply connected domain with account for shortest distances
From MaRDI portal
Publication:2263288
DOI10.1007/S10559-014-9626-4zbMATH Open1311.93007OpenAlexW2092915069MaRDI QIDQ2263288FDOQ2263288
Authors: V. V. Semkin, A. M. Chugay, Yu. Stoyan 
Publication date: 18 March 2015
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-014-9626-4
Recommendations
- Constructing the starting points and searching for the local extrema of the layout problem of 3D objects in a cylindrical domain
- Balance layout problem for 3D-objects: mathematical model and solution methods
- Minimax optimal placement problem for special-form objects on a multiply connected domain
- Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
- Combinatorial configurations in balance layout optimization problems
Cites Work
- Introduction to algorithms.
- MIP-based heuristic for non-standard 3D-packing problems
- Linearization method for inverse convex programming
- Packing unequal circles into a strip of minimal length with a jump algorithm
- \(\Phi\)-function and its basic properties
- The normalized \(\Phi\)-function for parallelepiped and spherocylinder
- The normalized \(\Psi\)-function for spherical segments
Cited In (12)
- Configuration space of geometric objects
- \( \Phi \)-functions of 2D objects with boundaries being second-order curves
- Title not available (Why is that?)
- Multi-objective optimization of layout with functional constraints
- Minimax optimal placement problem for special-form objects on a multiply connected domain
- Constructing the starting points and searching for the local extrema of the layout problem of 3D objects in a cylindrical domain
- Multistage approach to solving the optimization problem of packing nonconvex polyhedra
- Continuous extensions on Euclidean combinatorial configurations
- Sparse balanced layout of spherical voids in three-dimensional domains
- Theory and methods of Euclidian combinatorial optimization: current status and prospects
- Formalizing spatial configuration optimization problems with the use of a special function class
- Development of a joint distance constraint for optimized topology and optimized connection for multiple components
This page was built for publication: Optimization of 3D objects layout into a multiply connected domain with account for shortest distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2263288)
