Minimum-Cost Flows Over Time.

Miriam Schlöter Robert Weismantel

Published in: CoRR (2022)

Keyphrases

minimum cost
np hard
network flow
approximation algorithms
capacity constraints
spanning tree
network flow problem
network simplex algorithm
minimum cost flow
lower bound
scheduling problem
supply chain
undirected graph
edit operations