The variance location problem on a network with continuously distributed demand

RAIRO - Operations Research

Volumn 34, Issue 2, 2000, Pages 155-181

  López De Los Mozos, Ma Cruz ^a   Mesa, Juan A ^b  

^a UNIVERSITY OF SEVILLE   (Spain)

^b UNIVERSIDAD DE SEVILLA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FUNCTIONS; OPTIMIZATION;

VARIANCE LOCATION PROBLEM;

OPERATIONS RESEARCH;

EID: 17644433880     PISSN: 03990559     EISSN: 28047303     Source Type: Journal    
DOI: 10.1051/ro:2000109     Document Type: Article

References (18)

1. A. AHO, J. HOPCROFT and J. ULLMAN, The design and analysis of computer algorithms. Addison-Wesley (1974).
2. O. BERMAN, Mean-Variance location problems. Transportation Science 24 (1990) 287-293.
3. M.L. BRANDEAU, S.S. CHIU and R. BATTA, Locating the two-median of a tree network with continuous link demands. Ann. Oper. Res. 6 (1986) 223-253.
4. T.M. CAVALIER and H.D. SHERALI, Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree. European J. Oper. Res. 23 (1986) 246-255.
5. S.S. CHIU, The minisum location problem on an undirected network with continuous link demands. Comput. Oper. Res. 14 (1987) 369-383.
6. R.L. CHURCH and R.S. GARFINKEL, Locating an obnoxious facility on a network. Transportation Sci. 12 (1978) 107-118.
7. R.S. GARFINKEL, A.W. NEEBE and M.R. RAO, The m-center problem: Minimax facility location. Management Sci. 23 (1977) 1133-1142.
8. S.L. HAKIMI, Optimum locations of Switching Centers and the Absolute Centers and Medians of a graph. Oper. Res. 12 (1964) 450-459.
9. S.L. HAKIMI, Optimum distribution of switching centers in a communications network and some related graph-theoretic problems. Oper. Res. 13 (1965) 462-475.
10. J. HALPERN and O. MAIMON, Accord and conflict among several objectives in locational decisions on tree networks, in Locational Analysis of Public Facilities, edited by J.F. THISSE and H.G. HOLLER, Series of Studies in Mathematical and Managerial Economics. North-Holland, Amsterdam (1983) 301-314.
11. P. HANSEN and M. ZHENG, An algorithm for the minimum variance point of a network. RAIRO Oper. Res. 25 (1991) 119-126.
12. J.N. HOOKER, Solving nonlinear single-facility network location problems. Oper. Res. 34 (1986) 732-743.
13. R.K. KINCAID and O. MAIMON, Locating a point of minimum variance on triangular graphs. Transportation Sci. 23 (1989) 216-219.
14. R.K. KINCAID and O. MAIMON, A note on locating a central vertex of a 3-cactus graph. Comput. Oper. Res. 17 (1990) 315-320.
15. M. LABBE, The median location problem with continuous demand. Cahiers Centre Étude Reck Opér. 34 (1992) 103-115.
16. M.C. LÓPEZ DE LOS MOZOS, Localización en redes con el criterio varianza, Tesis doctoral, Universidad de Sevilla (1997).
17. O. MAIMON, The variance equity measure in locational decision theory. Ann. Oper. Res. 6 (1986) 147-160.
18. P.T. NKANSAH and H.T. DAVID, Network median problems with continuously distributed demand. Transportation Sci. 20 (1986) 213-219.