A polynomial algorithm for minimum quadratic cost flow problems

@inproceedings{Minoux1984APA,
  title={A polynomial algorithm for minimum quadratic cost flow problems},
  author={Michel Minoux},
  year={1984}
}
Abstract Network flow problems with quadratic separable costs appear in a number of important applications such as; approximating input-output matrices in economy; projecting and forecasting traffic matrices in telecommunication networks; solving nondifferentiable cost flow problems by subgradient algorithms. It is shown that the scaling technique introduced by Edmonds and Karp (1972) in the case of linear cost flows for deriving a polynomial complexity bound for the out-of-kilter method, may… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 26 CITATIONS

Collusion in Atomic Splittable Routing Games

  • Theory of Computing Systems
  • 2012
VIEW 1 EXCERPT
CITES BACKGROUND