Inverse Minimum Cut Problem with Lower and Upper Bounds

Adrian Deaconu and Laura Ciupala
Additional contact information
Adrian Deaconu: Department of Mathematics and Computer Science, Faculty of Mathematics and Computer Science, Transilvania University of Brasov, 50003 Brașov, Romania
Laura Ciupala: Department of Mathematics and Computer Science, Faculty of Mathematics and Computer Science, Transilvania University of Brasov, 50003 Brașov, Romania

Mathematics, 2020, vol. 8, issue 9, 1-10

Abstract: 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 l 1 norm is developed.

Keywords: minimum cut; maximum flow; inverse optimization (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/8/9/1494/pdf (application/pdf)
https://www.mdpi.com/2227-7390/8/9/1494/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:8:y:2020:i:9:p:1494-:d:408397

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().