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 | Entscheidung unter Unsicherheit | Decision under uncertainty | Algorithmus | Betriebliche Standortwahl | Firm location choice |
-
Minimax regret 1-sink location problem with accessibility in dynamic general networks
Li, Hongmei, (2016)
-
Minmax regret 1-facility location on uncertain path networks
Wang, Haitao, (2014)
-
A decomposition based minimax regret approach for inverse multiple criteria sorting problem
Özpeynirci, Özgür, (2023)
- More ...
-
Minimax regret 1-sink location problem with accessibility in dynamic general networks
Li, Hongmei, (2016)
-
Ni, Guanqun, (2015)
-
A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops
Dong, Jianming, (2020)
- More ...