Exact algorithms for solving a Euclidean maximum flow network interdiction problem.
Kelly M. SullivanJ. Cole SmithPublished in: Networks (2014)
Keyphrases
- exact algorithms
- maximum flow
- exact solution
- combinatorial optimization
- flow network
- knapsack problem
- approximation algorithms
- max sat
- combinatorial optimization problems
- resource allocation decisions
- heuristic methods
- combinatorial problems
- column generation
- max min
- exact methods
- branch and bound
- directed graph
- resource allocation
- data fusion
- metaheuristic
- particle swarm optimization
- state space