Minimum cost time-varying network flow problems.

Ebrahim Nasrabadi S. Mehdi Hashemi

Published in: Optim. Methods Softw. (2010)

Keyphrases

network flow problem
minimum cost
network simplex algorithm
network flow
np hard
approximation algorithms
network design problem
polynomially solvable
minimal cost
computational complexity
upper bound
linear programming
ant colony optimization
minimum cost flow