Publisher
Springer Science and Business Media LLC
Reference12 articles.
1. Ahuja R.K., Magnanti T., Orlin J.B.: Network Flows, Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs (1993)
2. Aissi, H., Bazgan, C., Vanderpooten, D.: Complexity of the Min–Max (Regret) versions of cut problems. In: Proceedings of the 16th Internat. Symp. on Algorithms and Computation (ISAAC 2005). LNCS, vol. 3827, pp. 789–798 (2005)
3. Atamtürk A., Zhang M.: Two-stage robust network flow and design under demand uncertainty. Oper. Res. 55(4), 662–673 (2007)
4. Berge C.: Graphs and Hypergraphs. North Holland, Amsterdam (1973)
5. Bertsimas D., Sim M.: Robust discrete optimization and network flows. Math. Prog. B 98, 49–71 (2003)
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献