Solving the Convex Cost Integer Dual Network Flow Problem.

Ravindra K. Ahuja Dorit S. Hochbaum James B. Orlin

Published in: Manag. Sci. (2003)

Keyphrases

network flow problem
minimum cost
minimal cost
fixed charge
minimum cost flow
multi commodity
np hard
network flow
network design problem
network simplex algorithm
approximation algorithms
mixed integer
convex optimization
convex hull
search space
transportation problem
endpoints
upper bound