scholarly journals On the minmax regret path median problem on trees

2015 ◽  
Vol 81 (7) ◽  
pp. 1159-1170 ◽  
Author(s):  
Jhih-Hong Ye ◽  
Biing-Feng Wang
Keyword(s):  
Median Problem ◽  
Minmax Regret

An improved algorithm for the minmax regret median problem on a tree

Networks ◽  
2003 ◽  
Vol 41 (2) ◽  
pp. 97-103 ◽  
Author(s):  
Igor Averbakh ◽  
Oded Berman
Keyword(s):  
Median Problem ◽  
Minmax Regret ◽  
Improved Algorithm

Minmax Regret Maximal Covering Location Problems with Edge Demands

2020 ◽  
pp. 105181
Author(s):  
Marta Baldomero-Naranjo ◽  
Jörg Kalcsics ◽  
Antonio M. Rodríguez-Chía
Keyword(s):  
Location Problems ◽  
Maximal Covering ◽  
Minmax Regret

A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty

2021 ◽  
Author(s):  
Iago A. Carvalho ◽  
Thiago F. Noronha ◽  
Christophe Duhamel ◽  
Luiz F. M. Vieira ◽  
Vinicius F. dos Santos
Keyword(s):  
Shortest Path ◽  
Interval Uncertainty ◽  
Minmax Regret

Less is more: discrete starting solutions in the planar p-median problem

Top ◽  
2021 ◽  
Author(s):  
Pawel Kalczynski ◽  
Jack Brimberg ◽  
Zvi Drezner
Keyword(s):  
Median Problem ◽  
Less Is More ◽  
Starting Solutions

Parallel iterative solution-based tabu search for the obnoxious p-median problem

2021 ◽  
Vol 127 ◽  
pp. 105155
Author(s):  
Jian Chang ◽  
Lifang Wang ◽  
Jin-Kao Hao ◽  
Yang Wang
Keyword(s):  
Tabu Search ◽  
Iterative Solution ◽  
Median Problem ◽  
Parallel Iterative
Sign in / Sign up

Export Citation Format

Share Document