Login / Signup

Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems.

Dimitri P. BertsekasPaul Tseng
Published in: Oper. Res. (1988)
Keyphrases
  • minimum cost
  • network flow problem
  • network flow
  • network simplex algorithm
  • np hard
  • approximation algorithms
  • minimal cost