Advanced search
Start date
Betweenand
Related content
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

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

Full text
Author(s):
Andretta, M. [1] ; Birgin, E. G. [2]
Total Authors: 2
Affiliation:
[1] Univ Sao Paulo, Inst Math & Comp Sci, Dept Appl Math & Stat, BR-13566590 Sao Carlos, SP - Brazil
[2] Univ Sao Paulo, Inst Math & Stat, Dept Comp Sci, BR-05508090 Sao Paulo - Brazil
Total Affiliations: 2
Document type: Journal article
Source: European Journal of Operational Research; v. 224, n. 1, p. 23-40, JAN 1 2013.
Web of Science Citations: 0
Abstract

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. (AU)

FAPESP's process: 10/18980-3 - Covering with ellipses using nonlinear programming
Grantee:Marina Andretta
Support Opportunities: Regular Research Grants
FAPESP's process: 10/10133-0 - Cutting, packing, lot-sizing and scheduling problems and their integration in industrial and logistics settings
Grantee:Reinaldo Morabito Neto
Support Opportunities: Research Projects - Thematic Grants
FAPESP's process: 06/53768-0 - Computational methods of optimization
Grantee:José Mário Martinez Perez
Support Opportunities: Research Projects - Thematic Grants
FAPESP's process: 09/10241-0 - Theory and software in computational methods for optimization
Grantee:Ernesto Julián Goldberg Birgin
Support Opportunities: Regular Research Grants