Randomized Minmax Regret for Combinatorial Optimization Under Uncertainty
暂无分享,去创建一个
[1] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[2] Daniel Vanderpooten,et al. Complexity of the min-max and min-max regret assignment problems , 2005, Oper. Res. Lett..
[3] Tim Roughgarden,et al. Algorithmic Game Theory , 2007 .
[4] Leonard J. Savage,et al. The Theory of Statistical Decision , 1951 .
[5] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[6] Daniel Vanderpooten,et al. Min-max and min-max regret versions of combinatorial optimization problems: A survey , 2009, Eur. J. Oper. Res..
[7] Tomasz Radzik,et al. Fractional Combinatorial Optimization , 2009, Encyclopedia of Optimization.
[8] Yang Jian,et al. On the robust shortest path problem , 1998, Comput. Oper. Res..
[9] C. Carathéodory. Über den variabilitätsbereich der fourier’schen konstanten von positiven harmonischen funktionen , 1911 .
[10] Adam Tauman Kalai,et al. Dueling algorithms , 2011, STOC '11.
[11] Manish Jain,et al. Computing optimal randomized resource allocations for massive security games , 2009, AAMAS.
[12] Melvyn Sim,et al. The Price of Robustness , 2004, Oper. Res..
[13] Vincent Conitzer,et al. Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games , 2010, AAAI.
[14] Adam Kasperski,et al. An approximation algorithm for interval data minmax regret combinatorial optimization problems , 2006, Inf. Process. Lett..
[15] Tomasz Radzik. Newton's method for fractional combinatorial optimization , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[16] Igor Averbakh,et al. Interval data minmax regret network optimization problems , 2004, Discret. Appl. Math..
[17] Ebrahim Nasrabadi,et al. On the power of randomization in network interdiction , 2013, Oper. Res. Lett..
[18] Antonio Alonso Ayuso,et al. Introduction to Stochastic Programming , 2009 .
[19] Adam Kurpisz,et al. Approximating the min-max (regret) selecting items problem , 2013, Inf. Process. Lett..
[20] Daniel Vanderpooten,et al. General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems , 2010, Discret. Optim..
[21] Daniel Vanderpooten,et al. Approximating Min-Max (Regret) Versions of Some Polynomial Problems , 2006, COCOON.
[22] Adam Kasperski,et al. On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data , 2007, Oper. Res. Lett..
[23] Alexander Shapiro,et al. Lectures on Stochastic Programming: Modeling and Theory , 2009 .
[24] Igor Averbakh,et al. On the complexity of a class of combinatorial optimization problems with uncertainty , 2001, Math. Program..
[25] A. L. Soyster. A Semi-Infinite Game , 1975 .
[26] Adam Kasperski,et al. Discrete Optimization with Interval Data - Minmax Regret and Fuzzy Approach , 2008, Studies in Fuzziness and Soft Computing.
[27] A Gerodimos,et al. Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..
[28] Daniel Vanderpooten,et al. Approximation of min-max and min-max regret versions of some combinatorial optimization problems , 2007, Eur. J. Oper. Res..
[29] J. Neumann. Zur Theorie der Gesellschaftsspiele , 1928 .
[30] David P. Williamson,et al. The Design of Approximation Algorithms , 2011 .
[31] Dimitris Bertsimas,et al. Optimization over integers , 2005 .
[32] Igor Averbakh,et al. On the complexity of minmax regret linear programming , 2005, Eur. J. Oper. Res..
[33] Allan Borodin,et al. On the power of randomization in on-line algorithms , 2005, Algorithmica.
[34] A. Wald. Contributions to the Theory of Statistical Estimation and Testing Hypotheses , 1939 .
[35] Daniel Vanderpooten,et al. Complexity of the Min-Max (Regret) Versions of Cut Problems , 2005, ISAAC.
[36] Katja Gruenewald,et al. Theory Of Games And Statistical Decisions , 2016 .
[37] Igor Averbakh. Computing and minimizing the relative regret in combinatorial optimization with interval data , 2005, Discret. Optim..