On dual minimum cost flow algorithms
Year of publication: |
2002
|
---|---|
Authors: | Vygen, Jens |
Published in: |
Mathematical Methods of Operations Research. - Springer. - Vol. 56.2002, 1, p. 101-126
|
Publisher: |
Springer |
Subject: | Minimum cost flow problem | strongly polynomial algorithm | dual algorithms | cut cancelling | dual network simplex |
-
On dual minimum cost flow algorithms
Vygen, Jens, (2002)
-
Robust minimum cost flow problem under consistent flow constraints
Büsing, Christina, (2021)
-
Transport and capacity planning for reusable containers under fixed-step transport costs
Krudewig, Christian, (2015)
- More ...
-
Efficient implementation of the Goldberg-Tarjan minimum-cost flow algorithm
Bünnagel, Ursula, (1998)
-
Die Einsatzplanung von Zementmischern und ein Traveling Salesman Problem
Triesch, Eberhard, (1994)
-
On dual minimum cost flow algorithms
Vygen, Jens, (1999)
- More ...