New exact algorithms for planar maximum covering location by ellipses problems-Reference-Cited by-同舟云学术

New exact algorithms for planar maximum covering location by ellipses problems

Published:2021-05 Issue:1 Volume:291 Page:114-127
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Tedeschi Danilo^ORCID,Andretta Marina^ORCID

Funder

Coordenação de Aperfeiçaoamento de Pessoal de Nível Superior

Fundação de Amparo à Pesquisa do Estado de São Paulo

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference20 articles.

1. LAPACK users’ guide;Anderson,1999

2. Deterministic and stochastic global optimization techniques for planar covering with ellipses problems;Andretta;European Journal of Operational Research,2013

3. On approximating the depth and related problems;Aronov;SIAM Journal of Computer,2008

4. Planar maximum coverage location problem with partial coverage and rectangular demand and service zones;Bansal;INFORMS Journal on Computing,2017

5. Covering many or few points with unit disks;de Berg;Theory of Computing Systems,2008

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimal coverage-based placement of static leak detection devices for pipeline water supply networks;Omega;2024-01

2. Efficient presolving methods for solving maximal covering and partial set covering location problems;European Journal of Operational Research;2023-11

3. The influence coverage optimization problem;IISE Transactions;2023-09-25

4. Multi-type maximal covering location problems: Hybridizing discrete and continuous problems;European Journal of Operational Research;2023-06

5. Opensource spatial optimization in GIScience for strategic positioning;Transactions in GIS;2023-02-21