Deterministic and stochastic global optimization techniques for planar covering with ellipses problems

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.

MoreLess

Year of publication:	2013
Authors:	Andretta, M. ; Birgin, E.G.
Published in:	European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 224.2013, 1, p. 23-40
Publisher:	Elsevier
Subject:	Global optimization \| Non-linear programming \| Planar covering with ellipses \| Algorithms

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010580819