Minimum cost flow algorithms for series-parallel networks.

Wolfgang W. Bein Peter Brucker Arie Tamir

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

Keyphrases

minimum cost flow
series parallel
shortest path algorithm
optimization problems
computational complexity
minimum cost
worst case
simulated annealing
shortest path
combinatorial optimization
graph theory
bi objective