Minimax optimal placement problem for special-form objects on a multiply connected domain

DOI10.1007/S10559-007-0064-4zbMath1165.90616OpenAlexW2063262177MaRDI QIDQ2467984

Yu. A. Shapovalov, S. I. Yaremchuk

Publication date: 30 January 2008

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-007-0064-4

zbMATH Keywords

minimax problemoptimal placementmethod of feasible directionsmethod of directed transition

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Combinatorial optimization (90C27)

Cites Work

• Inverse convex programming and parallelepiped packing
• Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
• Unnamed Item

This page was built for publication: Minimax optimal placement problem for special-form objects on a multiply connected domain