Login / Signup
Budget-constrained minimum cost flows.
Michael Holzhauser
Sven Oliver Krumke
Clemens Thielen
Published in:
J. Comb. Optim. (2016)
Keyphrases
</>
minimum cost
np hard
approximation algorithms
spanning tree
network flow
network flow problem
capacity constraints
undirected graph
network simplex algorithm
minimum cost flow
special case
multi objective
mobile robot
scheduling problem