Könen, D., & Stiglmayr, M. (2025). An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems. Discrete Applied Mathematics, 376, 1-14. https://doi.org/10.1016/j.dam.2025.06.001
Chicago-Zitierstil (17. Ausg.)Könen, David, und Michael Stiglmayr. "An Output-polynomial Time Algorithm to Determine All Supported Efficient Solutions for Multi-objective Integer Network Flow Problems." Discrete Applied Mathematics 376 (2025): 1-14. https://doi.org/10.1016/j.dam.2025.06.001.
MLA-Zitierstil (9. Ausg.)Könen, David, und Michael Stiglmayr. "An Output-polynomial Time Algorithm to Determine All Supported Efficient Solutions for Multi-objective Integer Network Flow Problems." Discrete Applied Mathematics, vol. 376, 2025, pp. 1-14, https://doi.org/10.1016/j.dam.2025.06.001.