Name
Abstract | ||
|---|---|---|
•A network simplex algorithm for the budget-constrained minimum cost flow problem is presented.•The algorithm is fully combinatorial and based on two kinds of integral node potentials and three kinds of reduced costs.•We prove optimality criteria and show how cycling can be avoided.•The algorithm can be implemented to run in pseudo-polynomial time. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.ejor.2016.11.024 | European Journal of Operational Research |
Keywords | DocType | Volume |
Combinatorial optimization,Algorithms,Network flow,Minimum cost flow,Network simplex | Journal | 259 |
Issue | ISSN | Citations |
3 | 0377-2217 | 1 |
PageRank | References | Authors |
0.35 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael Holzhauser | 1 | 13 | 3.34 |
| Sven O. Krumke | 2 | 308 | 36.62 |
| Clemens Thielen | 3 | 75 | 15.11 |