暂无分享,去创建一个
[1] Mihalis Yannakakis,et al. On the approximability of trade-offs and optimal access of Web sources , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[2] Eli Upfal,et al. Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems , 2007, ICALP.
[3] Noga Alon,et al. A Note on Network Reliability , 1995 .
[4] R. Tyrrell Rockafellar,et al. Scenarios and Policy Aggregation in Optimization Under Uncertainty , 1991, Math. Oper. Res..
[5] Benjamin Doerr. Improved approximation algorithms for the Min-Max Selecting Items problem , 2013, Inf. Process. Lett..
[6] Daniel Vanderpooten,et al. Complexity of the min-max and min-max regret assignment problems , 2005, Oper. Res. Lett..
[7] Mohit Singh,et al. On the Crossing Spanning Tree Problem , 2004, APPROX-RANDOM.
[8] Peter Eades,et al. On Optimal Trees , 1981, J. Algorithms.
[9] Jerrold R. Griggs. Lower bounds on the independence number in terms of the degrees , 1983, J. Comb. Theory, Ser. B.
[10] David P. Williamson,et al. The Design of Approximation Algorithms , 2011 .
[11] Adam Kurpisz,et al. Approximating the min-max (regret) selecting items problem , 2013, Inf. Process. Lett..
[12] Alexandre Dolgui,et al. Min–max and min–max (relative) regret approaches to representatives selection problem , 2012, 4OR.
[13] Xavier Gandibleux,et al. An Annotated Bibliography of Multiobjective Combinatorial Optimization , 2000 .
[14] Robin Thomas,et al. The Four-Colour Theorem , 1997, J. Comb. Theory, Ser. B.
[15] Alan M. Frieze,et al. A new rounding procedure for the assignment problem with applications to dense graph arrangement problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[16] Christina Büsing. Recoverable robust shortest path problems , 2012, Networks.
[17] Daniel Vanderpooten,et al. Min-max and min-max regret versions of combinatorial optimization problems: A survey , 2009, Eur. J. Oper. Res..
[18] David Zuckerman,et al. Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .
[19] Adam Kurpisz,et al. Approximability of the robust representatives selection problem , 2014, Oper. Res. Lett..
[20] E. L. Ulungu,et al. Multi‐objective combinatorial optimization problems: A survey , 1994 .
[21] Gerhard J. Woeginger,et al. Complexity and in-approximability of a selection problem in robust optimization , 2013, 4OR.
[22] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[23] Matthias Ehrgott,et al. Multicriteria Optimization , 2005 .
[24] Mohit Singh,et al. New approaches to multi-objective optimization , 2013, Mathematical Programming.
[25] Roger J.-B. Wets,et al. The aggregation principle in scenario analysis stochastic optimization , 1989 .
[26] R. Wets,et al. Stochastic programming , 1989 .
[27] Harald Niederreiter,et al. Probability and computing: randomized algorithms and probabilistic analysis , 2006, Math. Comput..
[28] Igor Averbakh,et al. On the complexity of a class of combinatorial optimization problems with uncertainty , 2001, Math. Program..
[29] Rolf H. Möhring,et al. The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications , 2009, Robust and Online Large-Scale Optimization.
[30] Laurent El Ghaoui,et al. Robust Optimization , 2021, ICORES.
[31] Adam Kasperski,et al. On the approximability of robust spanning tree problems , 2010, Theor. Comput. Sci..
[32] A Gerodimos,et al. Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..