On the Complexity of Nonoverlapping Multivariate Marginal Bounds for Probabilistic Combinatorial Optimization Problems
From MaRDI portal
Publication:2892221
DOI10.1287/opre.1110.1005zbMath1245.90099OpenAlexW2111697309MaRDI QIDQ2892221
Karthik Natarajan, Xuan Vinh Doan
Publication date: 18 June 2012
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1110.1005
Related Items
Distributionally robust mixed integer linear programs: persistency models with applications, Extremal Probability Bounds in Combinatorial Optimization, Distributionally robust optimization under endogenous uncertainty with an application in retrofitting planning, Distributionally robust optimization with polynomial densities: theory, models and algorithms, Distributionally robust joint chance-constrained programming: Wasserstein metric and second-order moment constraints, Wasserstein distributionally robust chance-constrained program with moment information, Exploiting partial correlations in distributionally robust optimization, Robustness to Dependency in Portfolio Optimization Using Overlapping Marginals, Technical Note—Robust Newsvendor Games with Ambiguity in Demand Distributions, Worst-Case Expected Shortfall with Univariate and Bivariate Marginals, A distributionally robust perspective on uncertainty quantification and chance constrained programming
