The global optimal solution to the three-dimensional layout optimization model with behavioral constraints.

DOI10.1007/BF02935764zbMath1141.90501OpenAlexW2038370769MaRDI QIDQ1880491

Tie Jun, En-Min Feng

Publication date: 28 September 2004

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02935764

zbMATH Keywords

optimizationthree-dimensional layoutglobal optimal solutionlocally Lipschitz continuous

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Stochastic programming (90C15)

Related Items (1)

The layout problem of two kinds of graph elements with performance constraints and its optimality conditions

Cites Work

• An algorithm of global optimization for solving layout problems
• Optimization. Algorithms and consistent approximations
• A global optimization algorithm for the three-dimensional packing problem
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The global optimal solution to the three-dimensional layout optimization model with behavioral constraints.