TY - GEN
T1 - New results on minimax regret single facility ordered median location problems on networks
AU - Puerto, Justo
AU - Rodriguez-Chia, Antonio M.
AU - Tamir, Arie
PY - 2007
Y1 - 2007
N2 - We consider the single facility ordered median location problem with uncertainty in the parameters (weights) defining the objective function. We study two cases. In the first case the uncertain weights belong to a region with a finite number of extreme points, and in the second case they must also satisfy some order constraints and belong to some box, (convex case). To deal with the uncertainty we apply the minimax regret approach, providing strongly polynomial time algorithms to solve these problems.
AB - We consider the single facility ordered median location problem with uncertainty in the parameters (weights) defining the objective function. We study two cases. In the first case the uncertain weights belong to a region with a finite number of extreme points, and in the second case they must also satisfy some order constraints and belong to some box, (convex case). To deal with the uncertainty we apply the minimax regret approach, providing strongly polynomial time algorithms to solve these problems.
KW - Analysis of algorithms
KW - Facility location
KW - Networks
UR - http://www.scopus.com/inward/record.url?scp=38049027922&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-75520-3_22
DO - 10.1007/978-3-540-75520-3_22
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:38049027922
SN - 9783540755197
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 230
EP - 240
BT - Algorithms - ESA 2007 - 15th Annual European Symposium, Proceedings
PB - Springer Verlag
T2 - 15th Annual European Symposium on Algorithms, ESA 2007
Y2 - 8 October 2007 through 10 October 2007
ER -