Abstract
In this paper we first discuss the properties of minimum spanning tree and minimum spanning tree with partition constraints. We then concentrate on the inverse problem of minimum spanning tree with partition constraints in which we need to adjust the weights of the edges in a network as less as possible so that a given spanning tree becomes the minimum one among all spanning trees that satisfy the partition restriction. Based on the calculation of maximum cost flow in networks, we propose a strongly polynomial algorithm for solving the problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Burton D, Toint PhL (1992) On an instance of the inverse shortest paths problem. Mathematical Programming 53:45–61
Burton D, Pulleyblank B, Toint PhL (1993) The inverse shortest problem with upper bounds on shortest path costs. Internal Report, FUNDP
Zhang J, Ma Z, Yang C (1995) A column generation method for inverse shortest path problems. ZOR — Mathematical Methods of Operations Research 41:347–358
Xu S, Zhang J (1995) An inverse problem of the weighted shortest path problem. The Japan Journal of Industrial and Applied Mathematics 12:47–60
Hu Z, Liu Z (1994) A strongly polynomial algorithm for inverse shortest arborescence problem. Working paper, the institute of system science, Academia Sinica, Beijing, China
Zhang J, Liu Z (1996) Calculating some inverse linear programming problems. To appear in Journal of Computational and Applied Mathematics
Ma Z, Xu S, Zhang J (1994) Algorithms for inverse minimum spanning tree problem. Research Report MA-94-16, Dept of Mathematics, City University of Hong Kong
Bondy TA, Murty USR (1976) Graph theory with applications. Macmillan Press
Ma Z, Liu Z, Cai M (1980) Optimum restricted base of a matroid. Annals of Discrete Mathematics 9:253–257
Nemhauser GL, Wolsey LA (1988) Integer and combinatorial optimization. Wiley, New York
Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: Theory, algorithm and applications. Prentice-Hall, Englewood Cliffs
Author information
Authors and Affiliations
Additional information
The author gratefully acknowledges the partial support of Croucher Foundation.
Rights and permissions
About this article
Cite this article
Zhang, J., Liu, Z. & Ma, Z. On the inverse problem of minimum spanning tree with partition constraints. Mathematical Methods of Operations Research 44, 171–187 (1996). https://doi.org/10.1007/BF01194328
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01194328