Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
DOI10.1007/978-3-319-41508-6_14zbMATH Open1380.90170OpenAlexW2567786109MaRDI QIDQ3133922FDOQ3133922
Authors: T. Romanova, A. Pankratov, A. V. Kovalenko, Peter Stetsyuk, Yu. Stoyan 
Publication date: 8 February 2018
Published in: Springer Optimization and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-41508-6_14
Recommendations
- Balance layout problem for 3D-objects: mathematical model and solution methods
- Combinatorial configurations in balance layout optimization problems
- Balanced optimization problems
- On Assembly-Line Balancing Problems
- The balanced linear programming problem
- scientific article; zbMATH DE number 917802
- On generalized balanced optimization problems
- Constrained balanced optimization problems
- A classification of assembly line balancing problems
- scientific article; zbMATH DE number 2159452
optimization algorithmsdistance constraintslayout problems\(\phi\)-functionsbehaviour constraintsNLP-modelsquasi-\(\phi\)-functions
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
- Quasi-phi-functions and optimal packing of ellipses
- 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
- On the global minimum in a balanced circular packing problem
- Basin filling algorithm for the circular packing problem with equilibrium behavioral constraints
- Optimized packings with applications
- Balance layout problem for 3D-objects: mathematical model and solution methods
Cited In (18)
- Configuration space of geometric objects
- Optimization of 3D objects layout into a multiply connected domain with account for shortest distances
- Combinatorial configurations in balance layout optimization problems
- Packing problems in space solved by CPLEX: an experimental analysis
- Sparse balanced layout of ellipsoids
- The concept of modeling packing and covering problems using modern computational geometry software
- Mathematical aspects of optimal layout problem of spent nuclear fuel containers on the storage site
- Optimized packing multidimensional hyperspheres: a unified approach
- Balance layout problem for 3D-objects: mathematical model and solution methods
- 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
- Parallel computing technologies for solving optimization problems of geometric design
- Theory and methods of Euclidian combinatorial optimization: current status and prospects
- Formalizing spatial configuration optimization problems with the use of a special function class
- Packing convex 3D objects with special geometric and balancing conditions
- Two approaches to modeling and solving the packing problem for convex polytopes
This page was built for publication: Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3133922)
