Softening the Robustness of Optimization Problems: A New Budgeted Uncertainty Approach
暂无分享,去创建一个
[1] Paweł Zieliński,et al. Robust Discrete Optimization Under Discrete and Interval Uncertainty: A Survey , 2016 .
[2] Igor Averbakh,et al. On the complexity of minmax regret linear programming , 2005, Eur. J. Oper. Res..
[3] Melvyn Sim,et al. The Price of Robustness , 2004, Oper. Res..
[4] Jean-Philippe Vial,et al. Robust Optimization , 2021, ICORES.
[5] Xin-She Yang,et al. Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.
[6] Anita Schöbel,et al. Generalized light robustness and the trade-off between robustness and nominal quality , 2014, Math. Methods Oper. Res..
[7] E. Gobet,et al. Stochastic Linear Programming , 2022 .
[8] Matteo Fischetti,et al. Light Robustness , 2009, Robust and Online Large-Scale Optimization.
[9] Refael Hassin,et al. Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..
[10] A Gerodimos,et al. Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..
[11] Allen L. Soyster,et al. Technical Note - Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming , 1973, Oper. Res..
[12] Guochuan Zhang,et al. A constrained minimum spanning tree problem , 2000, Comput. Oper. Res..
[13] P. Kall. STOCHASTIC LINEAR PROGRAMMING Models , Theory , and Computation , 2013 .
[14] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .