Network flow algorithms
Year of publication: |
1989
|
---|---|
Authors: | Goldberg, Andrew V. ; Tardos, Éva ; Tarjan, Robert E. |
Publisher: |
Bonn : Forschungsinst. für Diskrete Mathematik [u.a.] |
Subject: | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Netzplantechnik | Project network techniques |
Extent: | 65 S. |
---|---|
Series: | Report. - Bonn : Univ., ISSN 0724-3138, ZDB-ID 1019256-6. |
Type of publication: | Book / Working Paper |
Language: | English |
Source: | ECONIS - Online Catalogue of the ZBW |
-
A primal-dual simplex algorithm for bi-objective network flow problems
Eusébio, Augusto, (2009)
-
A least-squares minimum-cost network flow algorithm
Gopalakrishnan, Balaji, (2011)
-
An exact method for the biobjective shortest path problem for large-scale road networks
Duque, Daniel, (2015)
- More ...
-
Finding a feasible flow in astrongly connected network
Haeupler, Bernhard, (2008)
-
Culturally Induced Information Impactedness: A Prescription for Failure in Software Ventures
Matheson, Lesley R., (1998)
-
Culturally Induced Information Impactedness: A Prescription for Failure in Software Ventures
Matheson, Lesley R.,
- More ...