Relaxation Methods for Minimum Cost Network Flow Problemst

@inproceedings{Bertsekas1983RelaxationMF,
  title={Relaxation Methods for Minimum Cost Network Flow Problemst},
  author={Dimitri P. Bertsekas and Paul Tseng},
  year={1983}
}
We view the optimal single commodity network flow problem with linear arc costs and its dual as a pair of monotropic programming problems, i.e. problems of minimizing the separable sum of scalar extended real-valued convex functions over a subspace. For such problems directions of cost improvement can be selected from among a finite set of directions--the elementary vectors of the constraint subspace. The classical primal simplex, dual simplex, and primal-dual methods turn out to be particular… CONTINUE READING