Author:
Adjiashvili David,Zenklusen Rico
Funder
Swiss National Science Foundation
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference20 articles.
1. H. Aissi, C. Bazgan, D. Vanderpooten, Approximation complexity of min–max (regret) versions of shortest path, spanning tree, and knapsack, in: ESA, 2005, pp. 862–873.
2. A. Bar-Noy, S. Khuller, B. Schieber, The complexity of finding most vital arcs and nodes, Technical Report, Univ. of Maryland Institute for Advanced Computer Studies Report No. UMIACS-TR-95-96, College Park, MD, USA, 1995.
3. Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems;Ben-Tal;Mathematical Programming,2006
4. D. Bertsimas, C. Caramanis, Finite adaptability in multistage linear optimization, 2007.
5. Robust discrete optimization and network flows;Bertsimas;Mathematical Programming. Series B,2003
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献