Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Jean-Franois Baffier"'
Publikováno v:
Discrete Optimization. 22:20-36
We investigate variants of the max-flow problem in a network under k attacks. The network interdiction problem is to find the minimum max-flow value among (mk) networks that can be obtained by deleting each set of k links. The adaptive network flow p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27dafbfb0a4c03a6132f134d83e8b712
https://doi.org/10.1016/j.disopt.2016.05.002
https://doi.org/10.1016/j.disopt.2016.05.002
