Geodesic
The Inverse Maximum Flow Problem With Lower and Upper Bounds for the Flow
Yugoslav journal of operations research, Tome 18 (2008) no. 1, p. 13 Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

Voir la notice de l'article

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 $l_1$ 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.
Classification : 90B10 05C85 90C35
Keywords: Inverse problems, maximum flow, minimum cut, residual network, graph search 
@article{YJOR_2008_18_1_a1,
     author = {Adrian Deaconu},
     title = {The {Inverse} {Maximum} {Flow} {Problem} {With} {Lower} and {Upper} {Bounds} for the {Flow}},
     journal = {Yugoslav journal of operations research},
     pages = {13 },
     year = {2008},
     volume = {18},
     number = {1},
     zbl = {1274.90057},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/YJOR_2008_18_1_a1/}
}
TY  - JOUR
AU  - Adrian Deaconu
TI  - The Inverse Maximum Flow Problem With Lower and Upper Bounds for the Flow
JO  - Yugoslav journal of operations research
PY  - 2008
SP  - 13 
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/YJOR_2008_18_1_a1/
LA  - en
ID  - YJOR_2008_18_1_a1
ER  - 
%0 Journal Article
%A Adrian Deaconu
%T The Inverse Maximum Flow Problem With Lower and Upper Bounds for the Flow
%J Yugoslav journal of operations research
%D 2008
%P 13 
%V 18
%N 1
%U http://geodesic.mathdoc.fr/item/YJOR_2008_18_1_a1/
%G en
%F YJOR_2008_18_1_a1
Adrian Deaconu. The Inverse Maximum Flow Problem With Lower and Upper Bounds for the Flow. Yugoslav journal of operations research, Tome 18 (2008) no. 1, p. 13 . http://geodesic.mathdoc.fr/item/YJOR_2008_18_1_a1/