Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
From MaRDI portal
Publication:3133922
DOI10.1007/978-3-319-41508-6_14zbMath1380.90170OpenAlexW2567786109MaRDI QIDQ3133922
Tatiana E. Romanova, Peter Stetsyuk, A. V. Kovalenko, Alexandr Pankratov, Yu. G. 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
layout problemsoptimization algorithmsdistance constraints\(\phi\)-functionsbehaviour constraintsNLP-modelsquasi-\(\phi\)-functions
Related Items (11)
Two approaches to modeling and solving the packing problem for convex polytopes ⋮ Parallel computing technologies for solving optimization problems of geometric design ⋮ The concept of modeling packing and covering problems using modern computational geometry software ⋮ Packing Convex 3D Objects with Special Geometric and Balancing Conditions ⋮ Configuration space of geometric objects ⋮ Theory and methods of Euclidian combinatorial optimization: current status and prospects ⋮ Optimized packing multidimensional hyperspheres: a unified approach ⋮ Combinatorial configurations in balance layout optimization problems ⋮ Sparsest balanced packing of irregular 3D objects in a cylindrical container ⋮ Formalizing spatial configuration optimization problems with the use of a special function class ⋮ Packing Problems in Space Solved by CPLEX: An Experimental Analysis
Cites Work
- Quasi-phi-functions and optimal packing of ellipses
- On the global minimum in a balanced circular packing problem
- Modeling and optimization in space engineering.
- Phi-functions for 2D objects formed by line segments and circular arcs
- Balance layout problem for 3D-objects: mathematical model and solution methods
- The complexity of cutting complexes
- Modified \(r\)-algorithm to find the global minimum of polynomial functions
- Nondifferentiable optimization and polynomial problems
- Optimal clustering of a pair of irregular objects
- Mathematical model and efficient algorithms for object packing problem
- Optimized packings with applications
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Basin filling algorithm for the circular packing problem with equilibrium behavioral constraints
This page was built for publication: Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization