Abstract
In this paper we consider two inverse problems in combinatorial optimization: inverse maximum flow (IMF) problem and inverse minimum cut (IMC) problem. IMF (or IMC) problem can be described as: how to change the capacity vector C of a network as little as possible so that a given flow (or cut) becomes a maximum flow (or minimum cut) in the network. After discussing some characteristics of these problems, we propose strongly polynormial algorithms for the two inverse problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
