Следене
David Könen
Заглавие
Позовавания
Позовавания
Година
Finding all minimum cost flows and a faster algorithm for the K best flow problem
D Könen, DR Schmidt, C Spisla
Discrete Applied Mathematics, Pages 333-349, 2021
32021
An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems
D Könen, M Stiglmayr
arXiv preprint arXiv:2305.12867, 2023
12023
Output-sensitive Complexity of Multi-Objective Integer Network Flow Problems
D Könen, M Stiglmayr
arXiv preprint arXiv:2312.01786, 2023
2023
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–3