An ε-Relaxation Method for Separable Convex Cost Network Flow Problems.

Dimitri P. Bertsekas Lazaros C. Polymenakos Paul Tseng

Published in: SIAM J. Optim. (1997)

Keyphrases

network flow problem
minimal cost
minimum cost
fixed charge
network simplex algorithm
network design
network flow
transportation problem
computational complexity
linear programming
convex optimization
total cost
expected cost
network design problem