A least-squares minimum-cost network flow algorithm

doi:10.1007/s10479-011-0858-7

A least-squares minimum-cost network flow algorithm

2011-03-09

0

PRE

AI

DOI：10.1007/s10479-011-0858-7

Original

Original request for help

Save

Abstract

En 中文

Node-arc incidence matrices in network flow problems exhibit several special least-squares properties. We show how these properties can be leveraged in a least-squares primal-dual algorithm for solving minimum-cost network flow problems quickly. Computational results show that the performance of an upper-bounded version of the least-squares minimum-cost network flow algorithm with a special dual update operation is comparable to CPLEX Network and Dual Optimizers for solving a wide range of minimum-cost network flow problems.

Keywords:

Network flow

Least-squares

Primal-dual

A least-squares minimum-cost network flow algorithm

Abstract

Journal

Organization