A strongly polynomial contraction-expansion algorithm for network flow problems
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 | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Netzplantechnik | Project network techniques | Netzwerk | Network | Unternehmensnetzwerk | Business network | Algorithmus | Algorithm |
-
Models and algorithms for network reduction
Li, Gang, (2015)
-
Khodayifar, Salman, (2023)
-
A primal-dual simplex algorithm for bi-objective network flow problems
Eusébio, Augusto, (2009)
- More ...
-
Row-reduced column generation for degenerate master problems
Desrosiers, Jacques, (2014)
-
Vector space decomposition for solving large-scale linear programs
Gauthier, Jean Bertrand, (2018)
-
Tools for primal degenerate linear programs : IPS, DCA, and PE
Gauthier, Jean Bertrand, (2016)
- More ...