| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142926 | Operations Research Letters | 2008 | 5 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Eduardo Conde,