A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem.

Ruben Becker Maximilian Fickert Andreas Karrenbauer

Published in: ALENEX (2016)

Keyphrases

min cost
max flow
computational complexity
network flow
dynamic programming
search space
worst case
combinatorial optimization
linear programming
segmentation algorithm
simulated annealing
np hard
optimal solution
clustering algorithm
parallel implementation
primal dual
pairwise