Inverse Minimum Cut Problem with Lower and Upper Bounds
Keyword(s):
L1 Norm
◽
The inverse minimum cut problem is one of the classical inverse optimization researches. In this paper, the inverse minimum cut with a lower and upper bounds problem is considered. The problem is to change both, the lower and upper bounds on arcs so that a given feasible cut becomes a minimum cut in the modified network and the distance between the initial vector of bounds and the modified one is minimized. A strongly polynomial algorithm to solve the problem under l1 norm is developed.
Keyword(s):
1997 ◽
Vol 165-166
◽
pp. 377-394
◽
Keyword(s):
Keyword(s):