Greedy algorithms for the single-demand facility location problem
Year of publication: |
September 2017
|
---|---|
Authors: | Cheung, Sin-Shuen ; Williamson, David P. |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 45.2017, 5, p. 452-455
|
Subject: | Facility location | Approximation algorithm | Greedy algorithm | Betriebliche Standortwahl | Firm location choice | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Standorttheorie | Location theory | Ganzzahlige Optimierung | Integer programming |
-
Formulations and approximation algorithms for multilevel uncapacitated facility location
Ortiz-Astorquiza, Camilo, (2017)
-
An algorithmic framework for the exact solution of tree-star problems
Leitner, Markus, (2017)
-
Approximation algorithm for uniform bounded facility location problem
Kerui, Weng, (2013)
- More ...
-
Deterministic pivoting algorithms for constrained ranking and clustering problems
Zuylen, Anke van, (2009)
-
Stackelberg thresholds in network routing games or the value of altruism
Sharma, Yogeshwer, (2009)
-
Schalekamp, Frans, (2014)
- More ...