Minimax regret vertex centdian location problem in general dynamic networks
Year of publication: |
March 2018
|
---|---|
Authors: | Li, Hongmei ; Luo, Taibo ; Xu, Yinfeng ; Xu, Jiuping |
Published in: |
Omega : the international journal of management science. - Oxford [u.a.] : Elsevier, ISSN 0305-0483, ZDB-ID 124502-8. - Vol. 75.2018, p. 87-96
|
Subject: | Centdian location | General network | Minimax regret | Algorithm | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Betriebliche Standortwahl | Firm location choice |
-
Minimax regret 1-sink location problem with accessibility in dynamic general networks
Li, Hongmei, (2016)
-
On a class of algorithms solving the multifacility location problem with perturbed Lp-distances
Frenk, J. B., (1994)
-
Construction line algorithms for the connection location-allocation problem
Bischoff, Martin, (2008)
- More ...
-
Minimax regret 1-sink location problem with accessibility in dynamic general networks
Li, Hongmei, (2016)
-
Ni, Guanqun, (2015)
-
Rescheduling due to machine disruption to minimize the total weighted completion time
Luo, Wenchang, (2018)
- More ...