A note on the minmax regret centdian location on trees |
| |
| Authors: | Eduardo Conde |
| |
| Affiliation: | Departamento de Estadística e Investigación Operativa, Facultad de Matemáticas, Universidad de Sevilla, Campus Universitario de Reina Mercedes, 41012 Sevilla, Spain |
| |
| 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) is derived. This bound is improved in some special cases. |
| |
| Keywords: | Robust optimization Location Centdian criterion |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
