Geodesic
Finding the k Most Vital Elements of an s-t Planar Directed Network
Yugoslav journal of operations research, Tome 10 (2000) no. 1, p. 13 .

Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

For a given s-t planar directed network with lower and upper arc capacities we find those k arcs the removal of which minimizes the flow value of the maximum flow. Such arcs are called the k most vital arcs of the network. Analogously we find the k most vital nodes. Further more, we find the k bicriterial lexicographical most vital elements, the removal of which minimizes the maximum flow value first, and on the other hand, is the "cheapest" variant. Such problems arise if one wants to know in advance what the consequences will be if some of the network elements terminate their function or have to be switched off.
Classification : 90B10
Keywords: k most vital arcs/nodes, planarity of directed networks, multicriterial optimization on networks. 
@article{YJOR_2000_10_1_a1,
     author = {Dimiter Ivanchev},
     title = {Finding the k {Most} {Vital} {Elements} of an s-t {Planar} {Directed} {Network}},
     journal = {Yugoslav journal of operations research},
     pages = {13 },
     publisher = {mathdoc},
     volume = {10},
     number = {1},
     year = {2000},
     zbl = {0997.90009},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/YJOR_2000_10_1_a1/}
}
TY  - JOUR
AU  - Dimiter Ivanchev
TI  - Finding the k Most Vital Elements of an s-t Planar Directed Network
JO  - Yugoslav journal of operations research
PY  - 2000
SP  - 13 
VL  - 10
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/YJOR_2000_10_1_a1/
LA  - en
ID  - YJOR_2000_10_1_a1
ER  - 
%0 Journal Article
%A Dimiter Ivanchev
%T Finding the k Most Vital Elements of an s-t Planar Directed Network
%J Yugoslav journal of operations research
%D 2000
%P 13 
%V 10
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/YJOR_2000_10_1_a1/
%G en
%F YJOR_2000_10_1_a1
Dimiter Ivanchev. Finding the k Most Vital Elements of an s-t Planar Directed Network. Yugoslav journal of operations research, Tome 10 (2000) no. 1, p. 13 . http://geodesic.mathdoc.fr/item/YJOR_2000_10_1_a1/