Author:
Talla Nobibon Fabrice,Leus Roel
Publisher
Springer Science and Business Media LLC
Reference14 articles.
1. Averbakh, I.: On the complexity of a class of combinatorial optimization problems with uncertainty. Math. Program. Ser. A 90, 263–272 (2001)
2. Basagni, S.: Finding a maximal weighted independent set in wireless networks. Telecommun. Syst. 18, 155–168 (2001)
3. Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Math. Program. Ser. B 98, 49–71 (2003)
4. Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52, 35–53 (2004)
5. Frank, A.: Some polynomial algorithms for certain graphs and hypergraphs. In: Proceedings of the 5th British combinatorial conference, pp. 211–226, University of Aberdeen, Aberdeen (1975)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献