A network simplex method for the budget-constrained minimum cost flow problem
Year of publication: |
16 June 2017
|
---|---|
Authors: | Holzhauser, Michael ; Krumke, Sven O. ; Thielen, Clemens |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 259.2017, 3 (16.6.), p. 864-872
|
Subject: | Combinatorial optimization | Algorighms | Network flow | Minimum cost flow | Network simplex | Mathematische Optimierung | Mathematical programming | Netzwerk | Network | Graphentheorie | Graph theory | Netzplantechnik | Project network techniques | Unternehmensnetzwerk | Business network | Ganzzahlige Optimierung | Integer programming | Projektmanagement | Project management |
-
A strongly polynomial contraction-expansion algorithm for network flow problems
Gauthier, Jean Bertrand, (2017)
-
Finding the most degree-central walks and paths in a graph : exact and heuristic approaches
Matsypura, Dmytro, (2023)
-
On finding representative non-dominanted points for bi-objective integer network flow problems
Eusébio, Augusto, (2014)
- More ...
-
A generalized approximation framework for fractional network flow and packing problems
Holzhauser, Michael, (2018)
-
An FPTAS for the knapsack problem with parametric weights
Halman, Nir, (2018)
-
Full implementation of social choice functions in dominant strategies
Krumke, Sven O., (2019)
- More ...