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

DOI10.1007/S10559-007-0064-4zbMATH Open1165.90616OpenAlexW2063262177MaRDI QIDQ2467984FDOQ2467984

Authors: S. I. Yaremchuk, Yu. A. Shapovalov 

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

Recommendations

• Optimization of 3D objects layout into a multiply connected domain with account for shortest distances
• Local optimization method in placement problems of polygons
• Formalizing spatial configuration optimization problems with the use of a special function class
• Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
• Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem

zbMATH Keywords

optimal placementminimax problemmethod of feasible directionsmethod of directed transition

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
• Inverse convex programming and parallelepiped packing

Cited In (2)

• Local optimization method in placement problems of polygons
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467984)