The inverse maximum flow problem with lower and upper bounds for the flow | Zendy

Adrian Deaconu | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The inverse maximum flow problem with lower and upper bounds for the flow

Author(s) -

Adrian Deaconu

Publication year - 2008

Publication title -

yugoslav journal of operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.221

H-Index - 21

eISSN - 1820-743X

pISSN - 0354-0243

DOI - 10.2298/yjor0801013d

Subject(s) - maximum flow problem , mathematics , upper and lower bounds , flow (mathematics) , inverse , minimum cost flow problem , inverse problem , norm (philosophy) , mathematical optimization , combinatorics , flow network , mathematical analysis , geometry , political science , law

The general inverse maximum flow problem (denoted GIMF) is considered, where lower and upper bounds for the flow are changed so that a given feasible flow becomes a maximum flow and the distance (considering l1 norm) between the initial vector of bounds and the modified vector is minimum. Strongly and weakly polynomial algorithms for solving this problem are proposed. In the paper it is also proved that the inverse maximum flow problem where only the upper bound for the flow is changed (IMF) is a particular case of the GIMF problem

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research