Algorithms for the robust 1-center problem on a tree

Abstract We consider the weighted 1-center problem on a network with uncertainty in node weights and edge lengths. Uncertainty is modelled by means of interval estimates for parameters. Specifically, each uncertain parameter is assumed to be random with unknown distribution and can take on any value within a corresponding prespecified interval. It is required to find a robust (minmax regret) solution, that is, a location which is e -optimal for any possible realization of parameters, with e as small as possible. The problem on a general network is known to be NP-hard; for the problem on a tree, we present a polynomial algorithm.

[1]  Robert J. Vanderbei,et al.  Robust Optimization of Large-Scale Systems , 1995, Oper. Res..

[2]  Nimrod Megiddo,et al.  Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[3]  A. J. Goldman.  Optimal Center Location in Simple Networks , 1971 .

[4]  H. Frank,et al.  Optimum Locations on a Graph with Probabilistic Demands , 1966, Oper. Res..

[5]  A. Odoni,et al.  Locations of Medians on Stochastic Networks , 1979 .

[6]  Bintong Chen,et al.  Minmax‐regret robust 1‐median location on a tree , 1998 .

[7]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[8]  Martin E. Dyer,et al.  Linear Time Algorithms for Two- and Three-Variable Linear Programs , 1984, SIAM J. Comput..

[9]  N. Megiddo.  Linear-time algorithms for linear programming in R3 and related problems , 1982, FOCS 1982.

[10]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

[11]  G. O. Wesolowsky.  Probabilistic Weights in the One-Dimensional Facility Location Problem , 1977 .

[12]  Z. Drezner.  Sensitivity analysis of the optimal location of a facility , 1985 .

[13]  I. Averbakh,et al.  Minimax regret p-center location on a network with demand uncertainty , 1997 .

[14]  Martine Labbé,et al.  Sensitivity Analysis in Minisum Facility Location Problems , 1991, Oper. Res..

[15]  H. Frank,et al.  Letter to the Editor - Optimum Locations on Graphs with Correlated Normal Demands , 1967, Oper. Res..

[16]  Pitu B. Mirchandani,et al.  Location on networks : theory and algorithms , 1979 .

[17]  Oded Berman,et al.  Minmax Regret Median Location on a Network Under Uncertainty , 2000, INFORMS J. Comput..