A least-squares minimum-cost network flow algorithm
Year of publication: |
2011
|
---|---|
Authors: | Gopalakrishnan, Balaji ; Kong, Seunghyun ; Barnes, Earl ; Johnson, Ellis L. ; Sokol, Joel S. |
Published in: |
Annals of operations research. - Dordrecht, The Netherlands : Springer Nature B.V., ISSN 0254-5330, ZDB-ID 252629-3. - Vol. 186.2011, p. 119-140
|
Subject: | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Netzplantechnik | Project network techniques |
-
Goldberg, Andrew V., (1989)
-
A hybrid algorithm for solving convex separable network flow problems
Belling-Seib, Katharina, (1983)
-
A simplex algorithm for network flow problems with piecewise linear fractional objective function
Pandey, Pooja, (2009)
- More ...
-
A least-squares minimum-cost network flow algorithm
Gopalakrishnan, Balaji, (2011)
-
A least-squares primal-dual algorithm for solving linear programming problems
Barnes, Earl, (2002)
-
Optimal Protein Structure Alignment Using Maximum Cliques
Strickland, Dawn M., (2005)
- More ...