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

DOI10.1016/J.EJOR.2012.07.020MaRDI QIDQ2253403zbMATH OpenOpenAlexFDO

Authors Marina Andretta, E. G. Birgin

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) Graph representations (geometric and intersection representations, etc.) (05C62) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Recommendations

• Computational algorithms for the optimum covering of plane domains by a prescribed number of ellipses
• New exact algorithms for planar maximum covering location by ellipses problems
• The discrete ellipsoid covering problem: a discrete geometric programming approach
• An Ellipsoidal Branch and Bound Algorithm for Global Optimization
• scientific article; zbMATH DE number 3858857
• scientific article; zbMATH DE number 1204377
• Circumscribed ellipsoid algorithm for fixed-point problems
• Optimal circle covering problems and their applications
• A new simplicial cover technique in constrained global optimization
• Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants

Cited in

(6)

• scientific article; zbMATH DE number 2119696 (Why is no real title available?)
• Computational algorithms for the optimum covering of plane domains by a prescribed number of ellipses
• Covering with ellipses
• 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

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