.png){kind=icon}
.png){kind=icon}
Return
Deterministic and stochastic global optimization techniques for planar covering with ellipses problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2012.07.020.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Problems of planar covering with ellipses are tackled in this work. Ellipses can have a fixed angle or each of them can be freely rotated. Deterministic global optimization methods are developed for both cases, while a stochastic version of the method is also proposed for large instances of the latter case. Numerical results show the effectiveness and efficiency of the proposed methods. (C) 2012 Elsevier B.V. All rights reserved.
Keywords:
Global optimization
Non-linear programming
Planar covering with ellipses
Algorithms
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W