Finding all minimum cost flows and a faster algorithm for the K best flow problem.
David KönenDaniel R. SchmidtChristiane SpislaPublished in: CoRR (2021)
Keyphrases
- np hard
- minimum cost
- network flow
- optimal solution
- computational complexity
- minimum cost flow
- dynamic programming
- network flow problem
- objective function
- search space
- network simplex algorithm
- matching algorithm
- worst case
- np complete
- randomly generated
- linear programming
- spanning tree
- simulated annealing
- approximation ratio
- special case
- bayesian networks