Minmax regret 1-facility location on uncertain path networks
We propose an algorithm to compute the minmax regret. We solve the minmax 1-facility location problem on uncertain path network. Our algorithm improves the previous work. We discover new observations on the problem.
minmax regret path networks algorithms uncertainty facility location