Finding all minimum cost flows and a faster algorithm for the K best flow problem.

David Könen Daniel R. Schmidt Christiane Spisla

Published in: Discret. Appl. Math. (2022)

Keyphrases

minimum cost
np hard
computational complexity
dynamic programming
matching algorithm
optimal solution
worst case
linear programming
network flow problem
search algorithm
simulated annealing
search space
upper bound
spanning tree