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

DOI10.1016/j.ejor.2012.07.020zbMath1292.90215OpenAlexW2083752693MaRDI QIDQ2253403

Ernesto G. Birgin, Marina Andretta

Publication date: 27 July 2014

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2012.07.020

zbMATH Keywords

algorithmsglobal optimizationnonlinear programmingplanar covering with ellipses

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90) Stochastic programming (90C15) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Covering problems with polyellipsoids: a location analysis perspective ⋮ New exact algorithms for planar maximum covering location by ellipses problems ⋮ An elliptical cover problem in drone delivery network design and its solution algorithms

This page was built for publication: Deterministic and stochastic global optimization techniques for planar covering with ellipses problems