On cent-dians of general networks

Location Science - Tập 5 - Trang 15-28 - 1997
Wlodzimierz Ogryczak1
1Service de Mathématiques de la Gestion, Université Libre de Bruxelles, B-1050, Brussels, Belgium

Tài liệu tham khảo

Dearing, 1976, Convex location problems on tree networks, Operations Research, 24, 628, 10.1287/opre.24.4.628 Francis, 1992 Hakimi, 1965, Optimum distribution of switching centers in a communication network and some related graph theoretic problems, Operations Research, 13, 462, 10.1287/opre.13.3.462 Halpern, 1976, The location of a cent-dian convex combination on an undirected tree, Journal of Regional Science, 16, 237, 10.1111/j.1467-9787.1976.tb00966.x Halpern, 1978, Finding minimal center-median convex combination (cent-dian) of a graph, Management Science, 24, 534, 10.1287/mnsc.24.5.535 Handler, 1979 Hansen, 1991, From the median to the generalized center, RAIRO Recherche Operationelle, 25, 73, 10.1051/ro/1991250100731 Hansen, 1987, Single facility location on networks, Annals of Discrete Mathematics, 31, 113 Harvey, 1972, Social justice in spatial systems, Antipode, 1, 87 Labbé, 1995, Location on networks, 551 Morrill, 1977, Efficiency and equity aspects of optimum location, Geographical Analysis, 9, 215, 10.1111/j.1538-4632.1977.tb00575.x Rawls, 1971 Steuer, 1986 Wierzbicki, 1982, A mathematical basis for satisficing decision making, Mathematical Modelling, 3, 391, 10.1016/0270-0255(82)90038-0