A epsilon-Relaxation Method for Generalized Separable Convex Cost Network Flow Problems.
Paul TsengDimitri P. BertsekasPublished in: IPCO (1996)
Keyphrases
- network flow problem
- minimal cost
- minimum cost
- fixed charge
- transportation problem
- network flow
- network design problem
- network simplex algorithm
- network design
- convex hull
- convex optimization
- feasible solution
- np hard
- total cost
- approximation algorithms
- expected cost
- branch and bound
- constraint satisfaction problems
- upper bound
- bayesian networks