New exact algorithms for planar maximum covering location by ellipses problems

DOI10.1016/j.ejor.2020.09.029zbMath1487.90572OpenAlexW3044255870MaRDI QIDQ2029953

Danilo Tedeschi, Marina Andretta

Publication date: 4 June 2021

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

Full work available at URL: https://www.teses.usp.br/teses/disponiveis/55/55134/tde-23072020-154136/

zbMATH Keywords

combinatorial optimizationexact algorithmsplanar maximal covering location problemplanar covering by ellipses

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (4)

Multi-type maximal covering location problems: hybridizing discrete and continuous problems ⋮ Efficient presolving methods for solving maximal covering and partial set covering location problems ⋮ An elliptical cover problem in drone delivery network design and its solution algorithms ⋮ Lattice coverage of cuboid with minimum number of hemispheres

Uses Software

• LAPACK
• SymPy

Cites Work

• Covering many or few points with unit disks
• On a circle placement problem
• The Durand-Kerner method for trigonometric and exponential polynomials
• Deterministic and stochastic global optimization techniques for planar covering with ellipses problems
• ALGORITHMS FOR BALL HULLS AND BALL INTERSECTIONS IN NORMED PLANES
• On Approximating the Depth and Related Problems
• LAPACK Users' Guide
• Note—On a Modified One-Center Model
• Planar maximal covering location problem under block norm distance measure
• The QR Algorithm Revisited
• Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones

This page was built for publication: New exact algorithms for planar maximum covering location by ellipses problems