L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem.

Published in: Discret. Optim. (2015)

Keyphrases

np hard
minimum cost
computational complexity
worst case
similarity measure
search space
scheduling problem
spanning tree
optimal solution
dynamic programming
path planning
optimization model
network flow