Minimax regret 1-sink location problem with accessibility in dynamic general networks
Year of publication: |
2016
|
---|---|
Authors: | Li, Hongmei ; Xu, Yinfeng |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 250.2016, 2 (16.4.), p. 360-366
|
Subject: | Accessibility | Algorithm | General network | Location | Minimax regret | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Betriebliche Standortwahl | Firm location choice | Algorithmus |
-
Minimax regret vertex centdian location problem in general dynamic networks
Li, Hongmei, (2018)
-
The maximal covering location problem with accessibility indicators and mobile units
Vicencio-Medina, Salvador J., (2023)
-
Less is more : simple algorithms for the minimum sum of squares clustering problem
Kalczyński, Paweł, (2022)
- More ...
-
Minimax regret vertex centdian location problem in general dynamic networks
Li, Hongmei, (2018)
-
Collective water management and technical efficiency in rice production : evidence from China
Li, Hongmei, (2011)
-
Integrated risk study of Chinese commercial banks with fuzzy comprehensive appraisal method
Li, Hongmei, (2013)
- More ...