Author:
Finhold E.,Heller T.,Krumke S. O.,Leithäuser N.
Publisher
Springer International Publishing
Reference10 articles.
1. Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1988). Network flows. Alfred P. Sloan School of Management.
2. Goldberg, A. V., & Tarjan, R. E. (1989). Finding minimum-cost circulations by canceling negative cycles. Journal of the ACM (JACM), 36(4), 873–886.
3. Haese, R., Heller, T., & Krumke, S. O. (2020). Algorithms and complexity for the almost equal maximum flow problem. In Operations Research Proceedings 2019 (pp. 323–329). Springer.
4. Heller, T. (2021). Virtual prosumer consortia: A game theoretic optimization approach. Ph.D. thesis, TU Kaiserslautern.
5. Karp, R. M. (1978). A characterization of the minimum cycle mean in a digraph. Discrete Mathematics, 23(3), 309–311.