Balance layout problem for 3D-objects: mathematical model and solution methods
DOI10.1007/S10559-015-9746-5zbMATH Open1341.68295OpenAlexW2259068132MaRDI QIDQ747302FDOQ747302
Authors: A. A. Kovalenko, T. Romanova, P. I. Stetsyuk 
Publication date: 23 October 2015
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-015-9746-5
Recommendations
- Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
- Combinatorial configurations in balance layout optimization problems
- Layout optimization for the objects located within a rotating vessel -- a three-dimensional packing problem with behavioral constraints
- Packing convex 3D objects with special geometric and balancing conditions
- Sparse balanced layout of spherical voids in three-dimensional domains
nonlinear programmingShor's \(r\)-algorithmphi-functionadmissible distancesbalance layout problembehavior constraintsquasi phi-function
Cites Work
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Mathematical model and efficient algorithms for object packing problem
- The complexity of cutting complexes
- Optimal clustering of a pair of irregular objects
- Phi-functions for 2D objects formed by line segments and circular arcs
- Nondifferentiable optimization and polynomial problems
- Modeling and optimization in space engineering.
- Modified \(r\)-algorithm to find the global minimum of polynomial functions
- Quasi-phi-functions for a mathematical modeling of the relations of geometric objects
- Weighted singular decomposition and weighted pseudoinversion of matrices
- Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
Cited In (16)
- Optimization of 3D objects layout into a multiply connected domain with account for shortest distances
- Combinatorial configurations in balance layout optimization problems
- Title not available (Why is that?)
- Sparse balanced layout of ellipsoids
- Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem
- Mathematical aspects of optimal layout problem of spent nuclear fuel containers on the storage site
- Optimized packing multidimensional hyperspheres: a unified approach
- Constructing the starting points and searching for the local extrema of the layout problem of 3D objects in a cylindrical domain
- Sparsest balanced packing of irregular 3D objects in a cylindrical container
- Layout optimization for the objects located within a rotating vessel -- a three-dimensional packing problem with behavioral constraints
- Sparse balanced layout of spherical voids in three-dimensional domains
- Optimized filling of a given cuboid with spherical powders for additive manufacturing
- Parallel computing technologies for solving optimization problems of geometric design
- Digital model of natural cores using geometric design
- Packing convex 3D objects with special geometric and balancing conditions
- Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
Uses Software
This page was built for publication: Balance layout problem for 3D-objects: mathematical model and solution methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q747302)
