STAG-based Dynamic Two-commodity Maximum Flow Algorithm for Time-varying Networks.

Tao Zhang Hongyan Li Shun Zhang Peng Wang Jiandong Li

Published in: WCSP (2018)

Keyphrases

maximum flow
dynamic programming
probabilistic model
optimal solution
search space
knapsack problem
directed networks
similarity measure
linear programming
k means
pairwise
random walk
combinatorial optimization
directed graph
data clustering
simulated annealing
minimum spanning tree
minimum cut