A strongly polynomial contraction-expansion algorithm for network flow problems
Jean Bertrand Gauthier, Jacques Desrosiers, Marco E. Lübbecke
| Year of publication: |
August 2017
|
|---|---|
| Authors: | Gauthier, Jean Bertrand ; Desrosiers, Jacques ; Lübbecke, Marco E. |
| Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 84.2017, p. 16-32
|
| Subject: | Network flow problem | Residual network | Contracted network | Minimum mean cost cycle | Complexity analysis | Strongly polynomial algorithm | Mathematische Optimierung | Mathematical programming | Netzplantechnik | Project network techniques | Algorithmus | Algorithm | Projektmanagement | Project management | Netzwerk | Network | Unternehmensnetzwerk | Business network | Graphentheorie | Graph theory |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.cor.2017.02.019 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011710168