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 | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Netzwerk | Network | Scheduling-Verfahren | Scheduling problem |
-
On the maximum small-world subgraph problem
Kim, Jongeun, (2020)
-
A massively parallel exact solution algorithm for the balanced minimum evolution problem
Catanzaro, Daniele, (2023)
-
Sassi, Ons, (2017)
- More ...
-
An FPTAS for the knapsack problem with parametric weights
Halman, Nir, (2018)
-
A generalized approximation framework for fractional network flow and packing problems
Holzhauser, Michael, (2018)
-
Interval scheduling on related machines
Krumke, Sven O., (2011)
- More ...