TY - INPR
A1 - Güler, Cigdem
A1 - Hamacher, Horst W.
T1 - A Note On Inverse Max Flow Problem Under Chebyshev Norm
N2 - In this paper, we study the inverse maximum flow problem under \(\ell_\infty\)-norm and show that this problem can be solved by finding a maximum capacity path on a modified graph. Moreover, we consider an extension of the problem where we minimize the number of perturbations among all the optimal solutions of Chebyshev norm. This bicriteria version of the inverse maximum flow problem can also be solved in strongly polynomial time by finding a minimum \(s - t\) cut on the modified graph with a new capacity function.
T3 - Report in Wirtschaftsmathematik (WIMA Report) - 118
KW - inverse optimization
KW - maximum flows
KW - maximum capacity path
KW - minimum cut
Y1 - 2009
UR - https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2056
UR - https://nbn-resolving.org/urn:nbn:de:hbz:386-kluedo-15882
ER -