| Article ID: | iaor2009863 |
| Country: | Netherlands |
| Volume: | 36 |
| Issue: | 2 |
| Start Page Number: | 271 |
| End Page Number: | 275 |
| Publication Date: | Mar 2008 |
| Journal: | Operations Research Letters |
| Authors: | Conde Eduardo |
| Keywords: | networks |
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