Fetching the paper…
Reading the bibliography…
Distributionally robust optimization is used to tackle decision making problems under uncertainty where the distribution of the uncertain data is ambiguous.
G. Choquet. Theory of capacities. Annales de l’Institut Fourier, 5, 131–295, 1953
1953
Earlier work this paper cites.
R. M. V. Slyke. Letter to the Editor—Monte Carlo Methods and the PERT Problem. Operations Research 11(5), 1963
1963
Earlier work this paper cites.
J. Edmonds. Submodular functions, matroids, and certain polyhedra in: Combinatorial structures and their applications (R. Guy, H. Hanani, N. Sauer, J. Schönmein eds.), Gordon and Breach, 69-87, 1970
1970
Earlier work this paper cites.
L. G. Khachiyan. A polynomial algorithm in linear programming, Doklady Akademii Nauk SSSR 244, 1093-1096 (English translation: Soviet Math. Dokl. 20, 191-194), 1979
1979
Earlier work this paper cites.
A. H. Tchen. Inequalities for distributions with given marginals. The Annals of Probability, 8(4), 814-827, 1980
1980
Earlier work this paper cites.
L. Lovász, Submodular functions and convexity. Mathematical Programming The State of the Art, edited by A. Bachem and B. Korte and M. Grötschel, 235-257, 1983
1983
Earlier work this paper cites.
M. Grötschel, L. Lovász, A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer, 1988
1988
Earlier work this paper cites.
I. Pitowsky. Correlation polytopes: Their geometry and complexity. Mathematical Programming, 50, 395–414, 1991
1991
Earlier work this paper cites.
D. M. Topkis. Supermodularity and Complementarity. Princeton University Press, 1998
1998
Earlier work this paper cites.
I. Popescu. Applications of optimization in probability, finance and revenue management, PhD Thesis, Massachusetts Institute of Technology, 1999
1999
Earlier work this paper cites.
A. Müller, D. Stoyan. Comparison Methods for Stochastic Models and Risks. Wiley, 2002
2002
Earlier work this paper cites.
A. Ben-Tal, L. El Ghaoui, A. Nemirovski. Robust Optimization. Princeton University Press, 2009
2009
Earlier work this paper cites.
J. B Lasserre. Moments, Positive Polynomials and Their Applications. World Scientific, 2009
2009
Earlier work this paper cites.
D. Bertsimas, X. V. Doan, K. Natarajan, C. P. Teo. Models for minimax stochastic linear optimization problems with risk aversion. Mathematics of Operations Research, 35(3), 580–602, 2010
2010
Earlier work this paper cites.
E. Delage, Y. Ye. Distributionally robust optimization under moment uncertainty with application to data-driven problems. Operations Research, 58(3), 595–612, 2010
2010
Cited alongside, same era.
S. Agrawal, Y. Ding, A. Saberi, Y. Ye. Price of correlations in stochastic optimization. Operations Research, 60(1), 150-162, 2012
2012
Cited alongside, same era.
X. V. Doan, K. Natarajan. On the complexity of nonoverlapping multivariate marginal bounds for probabilistic combinatorial optimization problems. Operations Research, 60(1), 138-149, 2012
2012
Cited alongside, same era.
J. N. Hooker, H. P. Williams. Combining equity and utilitarianism in a mathematical programming model. Management Science, 58(9), 1682–1693, 2012
2012
Cited alongside, same era.
A. Ben-Tal, D. den Hertog, A. De Waegenaere, B. Melenberg, G. Rennen. Robust solutions of optimization problems affected by uncertain probabilities. Management Science, 59(2), 341-357, 2013
F. Bach. Submodular functions: from discrete to continuous domains. Mathematical Programming, 175, 419-459, 2019
2019
Later among the works it cites.
D. Bertsimas, M. Sim, M. Zhang. Adaptive distributionally robust optimization. Management Science, 65(2), 604-618, 2019
2019
Later among the works it cites.
J Blanchet, K. Murthy. Quantifying distributional model risk via optimal transport. Mathematics of Operations Research, 44(2), 565-600, 2019
2019
Later among the works it cites.
Z. Chen, M. Sim, P. Xiong. Robust stochastic optimization made easy with RSOME. Management Science, 66(8), 2020
2020
Later among the works it cites.
K. Natarajan. Optimization with Marginals and Moments. Dynamic Ideas, 2021
2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2013
Cited alongside, same era.
D. Iancu, M. Sharma, M. Sviridenko. Supermodularity and affine policies in dynamic robust optimization. Operations Research, 61(4), 941-956, 2013
2013
Cited alongside, same era.
L. Rüschendorf. Mathematical Risk Analysis: Dependence, Risk bounds, Optimal Allocations and Portfolios. Springer Berlin, 2013
2013
Cited alongside, same era.
E. Boros and A. Scozzari. Polynomially computable bounds for the probability of the union of events. Mathematical Programming, 148, 77–113, 2014
2014
Cited alongside, same era.
P. J. C. Dickinson and L. Gijben. On the computational complexity of membership problems for the completely positive cone and its dual. Computational Optimization and Applications, 57, 403–415, 2014
2014
Cited alongside, same era.
W. Wiesemann, D. Kuhn, M. Sim. Distributionally robust convex optimization. Operations Research, 62(6), 1358-1376, 2014
2014
Cited alongside, same era.
X. V. Doan, X. Li, K. Natarajan. Robustness to dependency in portfolio optimization using overlapping marginals. Operations Research, 63(6), 1468-1488, 2015
2015
Cited alongside, same era.
H-Y. Mak, Y. Rong, J. Zhang. Appointment scheduling with limited distributional information. Management Science, 61(2), 316–334, 2015
2015
Cited alongside, same era.
2022
Later among the works it cites.
L. Chen, W. Ma, K. Natarajan, D Simchi-Levi, Z Yan. Distributionally robust linear and discrete optimization with marginals. Operations Research, 70(3), 1822-1834, 2022
2022
Later among the works it cites.
J. M. Altschuler, E. Boix-Adsera. Polynomial-time algorithms for multimarginal optimal transport problems with structure. Mathematical Programming, 199, 1107–1178, 2023
2023
Closest in time.
R. Belbasi, A. Selvi, W. Wiesemann. It’s all in the mix: Wasserstein machine learning with mixed features. Working paper, 2023
2023
Closest in time.
A. K. Ramachandra and K. Natarajan. Tight probability bounds with pairwise independence. SIAM Journal on Discrete Mathematics, 37(2), 516–555, 2023
2023
Closest in time.
R. Gao, A. Kleywegt. Distributionally robust stochastic optimization with Wasserstein distance. Mathematics of Operations Research, 48(2), 603-655, 2023
2023
Closest in time.
D. Z. Long, J. Qin, A. Zhang. Supermodularity in two-stage distributional robust optimization. Operations Research, 70(3), 1394–1409, 2023
2023
Closest in time.