Author:
Raith Andrea,Ehrgott Matthias
Subject
Management Science and Operations Research,Modeling and Simulation,General Computer Science
Reference28 articles.
1. Network flows: theory, algorithms, and applications;Ahuja,1993
2. Complexity results for multicriteria and parametric network flows using a pathological graph of Zadeh;Ruhe;Zeitschrift für Operations Research,1988
3. Serafini P. Some considerations about computational complexity for multi-objective combinatorial problems. In: Jahn J, Krabs W, editors. Recent advances and historical development of vector optimization, Lecture Notes in Economics and Mathematical Systems, vol. 294. Berlin: Springer; 1986. p. 222–32.
4. The biobjective minimum cost flow problem;Sedeño-Noda;European Journal of Operational Research,2000
5. A note on k best network flows;Hamacher;Annals of Operations Research,1995
Cited by
38 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献