C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
An ε-relaxation method for separable convex cost generalized network flow problems.
Paul Tseng
Dimitri P. Bertsekas
Published in:
Math. Program. (2000)
Keyphrases
</>
network flow problem
minimal cost
minimum cost
fixed charge
transportation problem
network flow
network design
network design problem
network simplex algorithm
np hard
total cost
endpoints
feasible solution
approximation algorithms
fixed cost