Sign in
A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs.
Mathilde Vernet
Maciej Drozdowski
Yoann Pigné
Eric Sanlaville
Published in:
Discret. Appl. Math. (2021)
Keyphrases
</>
experimental study
synthetic datasets
optimization algorithm
linear programming
search space
computational efficiency
experimental evaluation
computational complexity
dynamic programming
minimum cost flow
worst case
convex hull
energy function
np hard
benchmark problems
graph model
shortest path problem