Abstract
Given a networkN = (V,A,c), a sources εV, a. sinkt εV and somes —t cuts and suppose each element of the capacity vectorc can be changed with a cost proportional to the changes, the inverse problem of minimum cuts we study here is to change the original capacities with the least total cost under restrictions on the changes of the capacities, so that all thoses —t cuts become minimum cuts with respect to the new capacities.
In this paper we shall show that the inverse problem of minimum cuts can be directly transformed into a minimum cost circulation problem and therefore can be solved efficiently by strongly polynomial algorithms.
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. Math. Prog. 53:45–61
Xu S, Zhang J (1995) An inverse problem of the weighted shortest path problem. Japan J. Indust. Appl. Math. 12:47–59
Zhang J, Ma Z, Yang C (1995) A column generation method for inverse shortest path problems. ZOR Math. Methods Oper. Res. 41:347–358
Zhang J, Liu Z, Ma Z (1996) On the inverse problem of minimum spanning tree with partition constraints. ZOR Math. Methods Oper. Res. 44:171–187
Zhang J, Liu Z (1996) Calculating some inverse linear programming problems. J. Comp. & Appl. Math 72:261–273
Zhang J, Ma Z (1996) A network flow method for solving some inverse combinatorial optimization problems. Optimization 37:59–72
Cai M, Li Y (1997) Inverse matroid intersection problem. ZOR Math. Methods Oper. Res. 45:235–243
Yang C, Zhang J, Ma Z (1997) Inverse maximum flow and minimum cut problems. Optimization 40:147–170
Yang X Inverse minimum cut problems. Working paper, Institute of Systems Science, Academia Sinica, Beijing, China
Ford LR, Fulkerson DR (1962) Flows in networks. Princeton University Press, Princeton, N.J.
Orlin JB (1988) A faster strongly polynomial minimum cost flow algorithm. Proc. 20th ACM Symp. on the Theory of Comp.: 377–387
Tardos E (1985) A strongly polynomial minimum cost circulation algorithm. Combinatorica 5:247–255
Tardos E (1986) A strongly polynomial algorithm to solve combinatorial linear programs. Operations Research 34:250–256
Hoffman AJ (1960) Some recent applications of the theory of linear inequalities to extremal combinatorial analysis. Proc. Symposium on Appl. Math. 10:113–127
Author information
Authors and Affiliations
Additional information
The author is grateful to the partial support of the Universities Grant Council of Hong Kong under the grant CITYU #9040189
Work partially supported by the National Natural Science Foundation of China
Rights and permissions
About this article
Cite this article
Zhang, J., Cai, M.C. Inverse problem of minimum cuts. Mathematical Methods of Operations Research 47, 51–58 (1998). https://doi.org/10.1007/BF01193836
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01193836