论文信息 - A Capacitated, Balanced, 2-Median Problem on a Tree Network with a Continuum of Link Demands

A Capacitated, Balanced, 2-Median Problem on a Tree Network with a Continuum of Link Demands

This note considers the problem of locating an absolute 2-median on an undirected tree network having discrete nodal demands as well as a continuum of link demands. The service facilities are assumed to have known finite capacities which sum to the total demand on the network. For this capacitated, balanced case, we derive certain necessary optimality conditions which admit useful localization results. These results permit us to identify and characterize a reduced, finite set of candidate solutions which may be compared to obtain an optimal 2-median for the problem.

Hanif D. Sherali | Frederick L. Nordai

[1] Margaret L. Brandeau,et al. Locating the two-median of a tree network with continuous link demands , 1986 .

[2] Samuel S. Chiu,et al. The minisum location problem on an undirected network with continuous link demands , 1987, Comput. Oper. Res..

[3] Pitu B. Mirchandani,et al. Localizing 2-medians on probabilistic and deterministic tree networks , 1980, Networks.

[4] A. J. Goldman. Optimal Center Location in Simple Networks , 1971 .

[5] S. L. Hakimi,et al. Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

[6] Hanif D. Sherali,et al. Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree , 1986 .

[7] Frederick Leon Nordai. Balanced, capacitated, location-allocation problems on networks with a continuum of demand , 1985 .

[8] Hanif D. Sherali,et al. NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands , 1988, Math. Oper. Res..

[9] O. Kariv,et al. An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[10] Edward Minieka,et al. The Centers and Medians of a Graph , 1977, Oper. Res..