Heuristic solutions to robust variants of the minimum-cost integer flow problem.

Marko Spoljarec Robert Manger

Published in: J. Heuristics (2020)

Keyphrases

minimum cost
network flow problem
minimum cost flow
np hard
network flow
approximation algorithms
spanning tree
capacity constraints
network simplex algorithm
worst case
undirected graph
minimal cost