Hardness and approximation for network flow interdiction.
Stephen R. ChestnutRico ZenklusenPublished in: Networks (2017)
Keyphrases
- network flow
- minimum cost
- linear programming
- approximation algorithms
- np hard
- capacity constraints
- integer programming
- network flow problem
- min cost
- optimization model
- set cover
- np complete
- computational complexity
- traffic control
- phase transition
- maximum flow
- genetic algorithm
- worst case
- integer program
- pairwise
- lower bound