A generalized upper bounding algorithm for multicommodity network flow problems.

James K. Hartman Leon S. Lasdon

Published in: Networks (1971)

Keyphrases

network flow problem
optimal solution
upper bounding
network design problem
minimal cost
np hard
network flow
cost function
dynamic programming
ant colony optimization
similarity measure
search space
computational complexity
objective function
branch and bound algorithm
optimization process
lower bound