Login / Signup
Polynomial-time identification of robust network flows under uncertain arc failures.
Vladimir Boginski
Clayton W. Commander
Timofey Turko
Published in:
Optim. Lett. (2009)
Keyphrases
</>
network flow
min cost
network flow problem
special case
robust estimation
optimization model
neural network
partial occlusion
network flow formulation
minimum cost
approximation algorithms
incomplete information
linear programming
worst case
dynamic programming
social networks
genetic algorithm