Abstract
This paper discusses the inverse center location problem restricted on a tree with different costs and bound constraints. The authors first show that the problem can be formulated as a series of combinatorial linear programs, then an O(∣V∣2 log ∣V∣) time algorithm to solve the problem is presented. For the equal cost case, the authors further give an O(∣V∣) time algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. Christofides, Graph Theory: An Algorithmic Approach, Academic Press, New York, 1975.
J. R. Evans and E. Minieka, Optimization Algorithms for Networks and Graphs, Marcel Dekker, Inc., New York, 1992.
C. Heuburger, Inverse optimization, a survey on problems, methods, and results, Journal of Combinatorial Optimization, 2004, 8(3): 329–361.
M. Cai, X. Yang, and J. Zhang, The complexity analysis of the inverse center location problem, Journal of Global Optimization, 1999, 15(4), 213–218.
E. Tardos, A strongly polynomial algorithm to solve combinatorial linear programs, Operations Research, 1986, 34(2): 250–256.
H. Booth and R. E. Tarjan, Finding the minimum-cost maximum flow in a serial-parallel network, Journal of Algorithms, 1993, 15(3): 416–446.
Author information
Authors and Affiliations
Corresponding author
Additional information
The research is supported by the National Natural Science Foundation of China under Grant Nos. 70425004, 70221001, and the National Key Research and Development Program of China under Grant No. 2002CB312004.
Rights and permissions
About this article
Cite this article
YANG, X., ZHANG, J. Inverse Center Location Problem on a Tree. J Syst Sci Complex 21, 651–664 (2008). https://doi.org/10.1007/s11424-008-9142-6
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11424-008-9142-6