New exact algorithms for planar maximum covering location by ellipses problems
Year of publication: |
2021
|
---|---|
Authors: | Tedeschi, Danilo ; Andretta, Marina |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 291.2021, 1 (16.5.), p. 114-127
|
Subject: | Combinatorial optimization | Exact algorithms | Planar covering by ellipses | Planar maximal covering location problem | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Standorttheorie | Location theory | Betriebliche Standortwahl | Firm location choice | Ganzzahlige Optimierung | Integer programming |
-
A mean-shift algorithm for large-scale planar maximal covering location problems
He, Zhou, (2016)
-
The facility location problem with capacity transfers
Corberán, Ángel, (2020)
-
Approximation algorithms for hard capacitated k-facility location problems
Aardal, Karen, (2015)
- More ...
-
Andretta, Marina, (2013)
-
Robust mixed-integer linear programming models for the irregular strip packing problem
Cherri, Luiz H., (2016)
-
A general heuristic for two-dimensional nesting problems with limited-size containers
Mundin, Leandro R., (2018)
- More ...