A note on the minmax regret centdian location on trees

The minmax regret optimization model of the doubly weighted centdian location on trees is considered. Assuming that both types of weights, demands and relative importance of the customers, are partially known through interval estimates, an exact algorithm of complexity O(n3logn)O(n3logn) is derived. This bound is improved in some special cases.