Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization

DOI10.1007/978-3-319-41508-6_14MaRDI QIDQ3133922zbMATH OpenOpenAlexFDO

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)

Copyright license Creative Commons Attribution-NonCommercial 2.5 Generic

Full work available at URL https://doi.org/10.1007/978-3-319-41508-6_14

zbMATH Keywords

optimization algorithmsdistance constraintslayout problems\(\phi\)-functionsbehaviour constraintsNLP-modelsquasi-\(\phi\)-functions

Mathematics Subject Classification ID

Nonlinear programming (90C30) Continuous location (90B85)

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

Cites work

• Balance layout problem for 3D-objects: mathematical model and solution methods
• Basin filling algorithm for the circular packing problem with equilibrium behavioral constraints
• Mathematical model and efficient algorithms for object packing problem
• Modeling and optimization in space engineering.
• Modified \(r\)-algorithm to find the global minimum of polynomial functions
• Nondifferentiable optimization and polynomial problems
• On the global minimum in a balanced circular packing problem
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Optimal clustering of a pair of irregular objects
• Optimized packings with applications
• Phi-functions for 2D objects formed by line segments and circular arcs
• Quasi-phi-functions and optimal packing of ellipses
• The complexity of cutting complexes

Cited in

(18)

• Sparse balanced layout of spherical voids in three-dimensional domains
• Optimization of 3D objects layout into a multiply connected domain with account for shortest distances
• Packing problems in space solved by CPLEX: an experimental analysis
• Formalizing spatial configuration optimization problems with the use of a special function class
• Sparse balanced layout of ellipsoids
• Parallel computing technologies for solving optimization problems of geometric design
• Layout optimization for the objects located within a rotating vessel -- a three-dimensional packing problem with behavioral constraints
• Sparsest balanced packing of irregular 3D objects in a cylindrical container
• The concept of modeling packing and covering problems using modern computational geometry software
• Two approaches to modeling and solving the packing problem for convex polytopes
• Packing convex 3D objects with special geometric and balancing conditions
• Mathematical aspects of optimal layout problem of spent nuclear fuel containers on the storage site
• Theory and methods of Euclidian combinatorial optimization: current status and prospects
• Configuration space of geometric objects
• Combinatorial configurations in balance layout optimization problems
• 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
• Optimized packing multidimensional hyperspheres: a unified approach

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)