On the public citation graph

Distributionally robust optimization through the lens of submodularity

https://doi.org/10.2139/ssrn.4677303
0 signed · 78 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jctb.2000.1989openalex-extracted
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
inferredcites →https://doi.org/10.1006/jmva.1999.1867openalex-extracted
Some Remarks on the Supermodular Order
inferredcites →https://doi.org/10.1007/978-3-540-72792-7_19openalex-extracted
A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization
inferredcites →https://doi.org/10.1007/978-3-642-33590-7openalex-extracted
Mathematical Risk Analysis: Dependence, Risk Bounds, Optimal Allocations and Portfolios
inferredcites →https://doi.org/10.1007/978-3-642-68874-4_10openalex-extracted
Submodular functions and convexity
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-extracted
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf02532273openalex-extracted
Partial orderings of permutations and monotonicity of a rank correlation statistic
inferredcites →https://doi.org/10.1007/bf02579273openalex-extracted
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1007/s10107-005-0597-0openalex-extracted
Computational complexity of stochastic programming problems
inferredcites →https://doi.org/10.1007/s10107-007-0165-xopenalex-extracted
Optimization with multivariate stochastic dominance constraints
inferredcites →https://doi.org/10.1007/s10107-007-0189-2openalex-extracted
A faster strongly polynomial time algorithm for submodular function minimization
inferredcites →https://doi.org/10.1007/s10107-011-0494-7openalex-extracted
Distributionally robust joint chance constraints with second-order moment information
inferredcites →https://doi.org/10.1007/s10107-015-0958-2openalex-extracted
A comment on “computational complexity of stochastic programming problems”
inferredcites →https://doi.org/10.1007/s10107-017-1172-1openalex-extracted
Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
inferredcites →https://doi.org/10.1007/s10107-018-1248-6openalex-extracted
Submodular functions: from discrete to continuous domains
inferredcites →https://doi.org/10.1007/s10107-022-01868-7openalex-extracted
Polynomial-time algorithms for multimarginal optimal transport problems with structure
inferredcites →https://doi.org/10.1016/0020-0190(80)90114-3openalex-extracted
Testing the universal instance assumption
inferredcites →https://doi.org/10.1016/0047-259x(90)90013-8openalex-extracted
Multivariate concordance
inferredcites →https://doi.org/10.1016/0166-218x(83)90070-7openalex-extracted
Bivalent trees and forests or upper bounds for the probability of a union revisited
inferredcites →https://doi.org/10.1016/0166-218x(90)90068-nopenalex-extracted
The discrete moment problem and linear programming
inferredcites →https://doi.org/10.1016/0885-064x(88)90006-4openalex-extracted
Probabilistic satisfiability
inferredcites →https://doi.org/10.1016/j.dam.2012.05.025openalex-extracted
Minimizing a sum of submodular functions
inferredcites →https://doi.org/10.1016/s0167-5060(05)x8001-3openalex-extracted
Submodular Functions and Optimization
inferredcites →https://doi.org/10.1016/s0167-6687(02)00134-8openalex-extracted
The concept of comonotonicity in actuarial science and finance: theory
inferredcites →https://doi.org/10.1016/s0167-6687(02)00135-xopenalex-extracted
The concept of comonotonicity in actuarial science and finance: applications
inferredcites →https://doi.org/10.1016/s0378-3758(96)00184-xopenalex-extracted
Orthant orderings of discrete random vectors
inferredcites →https://doi.org/10.1051/m2an/2015020openalex-extracted
Multi-marginal optimal transport: Theory and applications
inferredcites →https://doi.org/10.1093/biomet/69.2.297openalex-extracted
An Improved Bonferroni Inequality and Applications
inferredcites →https://doi.org/10.1109/focs.2015.68openalex-extracted
A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization
inferredcites →https://doi.org/10.1111/poms.13234openalex-extracted
Discrete Convex Analysis and Its Applications in Operations: A Survey
inferredcites →https://doi.org/10.1137/080734510openalex-extracted
Theory and Applications of Robust Optimization
inferredcites →https://doi.org/10.1137/1.9781611975994.51openalex-extracted
Near-optimal Approximate Discrete and Continuous Submodular Function Minimization
inferredcites →https://doi.org/10.1137/140955148openalex-extracted
Optimization with Multivariate Stochastic Dominance Constraints
inferredcites →https://doi.org/10.1137/s1052623401399903openalex-extracted
Optimal Inequalities in Probability Theory: A Convex Optimization Approach
inferredcites →https://doi.org/10.1137/s1052623403430610openalex-extracted
Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds
inferredcites →https://doi.org/10.1142/p665openalex-extracted
Moments, Positive Polynomials and Their Applications
inferredcites →https://doi.org/10.1145/3566050openalex-extracted
Minimizing Convex Functions with Rational Minimizers
inferredcites →https://doi.org/10.1145/502090.502096openalex-extracted
A combinatorial strongly polynomial algorithm for minimizing submodular functions
inferredcites →https://doi.org/10.1198/tech.2003.s176openalex-extracted
Comparison Methods for Stochastic Models and Risks
inferredcites →https://doi.org/10.1214/aoms/1177699260openalex-extracted
Some Concepts of Dependence
inferredcites →https://doi.org/10.1214/aop/1176994668openalex-extracted
Inequalities for Distributions with Given Marginals
inferredcites →https://doi.org/10.1287/ijoc.2019.0939openalex-extracted
Worst-Case Expected Shortfall with Univariate and Bivariate Marginals
inferredcites →https://doi.org/10.1287/mnsc.1120.1641openalex-extracted
Robust Solutions of Optimization Problems Affected by Uncertain Probabilities
inferredcites →https://doi.org/10.1287/mnsc.2013.1881openalex-extracted
Appointment Scheduling with Limited Distributional Information
inferredcites →https://doi.org/10.1287/moor.1030.0064openalex-extracted
On Multivariate Discrete Moment Problems and Their Applications to Bounding Expectations and Probabilities
inferredcites →https://doi.org/10.1287/moor.1100.0445openalex-extracted
Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion
inferredcites →https://doi.org/10.1287/moor.2014.0657openalex-extracted
Polynomially Computable Bounds for the Probability of the Union of Events
inferredcites →https://doi.org/10.1287/moor.5.2.186openalex-extracted
Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
inferredcites →https://doi.org/10.1287/msom.2013.0469openalex-extracted
Pooling and Dependence of Demand and Yield in Multiple-Location Inventory Systems
inferredcites →https://doi.org/10.1287/opre.1090.0712openalex-extracted
From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization
inferredcites →https://doi.org/10.1287/opre.1090.0741openalex-extracted
Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
inferredcites →https://doi.org/10.1287/opre.1090.0795openalex-extracted
Distributionally Robust Optimization and Its Tractable Approximations
inferredcites →https://doi.org/10.1287/opre.1110.1005openalex-extracted
On the Complexity of Nonoverlapping Multivariate Marginal Bounds for Probabilistic Combinatorial Optimization Problems
inferredcites →https://doi.org/10.1287/opre.1110.1011openalex-extracted
Price of Correlations in Stochastic Optimization
inferredcites →https://doi.org/10.1287/opre.2013.1172openalex-extracted
Supermodularity and Affine Policies in Dynamic Robust Optimization
inferredcites →https://doi.org/10.1287/opre.2014.1314openalex-extracted
Distributionally Robust Convex Optimization
inferredcites →https://doi.org/10.1287/opre.2015.1424openalex-extracted
Robustness to Dependency in Portfolio Optimization Using Overlapping Marginals
inferredcites →https://doi.org/10.1287/opre.2017.1688openalex-extracted
Robust Optimization with Ambiguous Stochastic Constraints Under Mean and Dispersion Information
inferredcites →https://doi.org/10.1287/opre.2020.1990openalex-extracted
The Discrete Moment Problem with Nonconvex Shape Constraints
inferredcites →https://doi.org/10.1287/opre.2021.2243openalex-extracted
Distributionally Robust Linear and Discrete Optimization with Marginals
inferredcites →https://doi.org/10.1287/opre.2022.0596openalex-extracted
Multivariate Almost Stochastic Dominance: Transfer Characterizations and Sufficient Conditions Under Dependence Uncertainty
inferredcites →https://doi.org/10.1287/opre.2022.2387openalex-extracted
Data-Driven Optimization with Distributionally Robust Second Order Stochastic Dominance Constraints
inferredcites →https://doi.org/10.1515/9781400822539openalex-extracted
Supermodularity and Complementarity
inferredcites →https://doi.org/10.1561/2200000039openalex-extracted
Learning with Submodular Functions: A Convex Optimization Perspective
inferredcites →https://doi.org/10.1561/9781601987570openalex-extracted
Learning with Submodular Functions: A Convex Optimization Perspective
inferredcites →https://doi.org/10.2139/ssrn.2317332openalex-extracted
inferredcites →https://doi.org/10.2139/ssrn.302322openalex-extracted
inferredcites →https://doi.org/10.2139/ssrn.3159473openalex-extracted
Distributionally Robust Linear and Discrete Optimization with Marginals
inferredcites →https://doi.org/10.2307/3212481openalex-extracted
An upper bound for the probability of a union
inferredcites →https://doi.org/10.48550/arxiv.1010.5511openalex-extracted
Efficient Minimization of Decomposable Submodular Functions
inferredcites →https://doi.org/10.48550/arxiv.1311.4296openalex-extracted
Reflection methods for user-friendly submodular optimization
inferredcites →https://doi.org/10.48550/arxiv.1703.01830openalex-extracted
Decomposable Submodular Function Minimization: Discrete and Continuous
inferredcites →https://doi.org/10.48550/arxiv.1706.07357openalex-extracted
Efficient Convex Optimization with Membership Oracles
inferredcites →https://doi.org/10.48550/arxiv.1708.02079openalex-extracted
inferredcites →https://doi.org/10.48550/arxiv.1802.05249openalex-extracted
Distributionally Robust Submodular Maximization
inferredcites →https://doi.org/10.48550/arxiv.2007.01445openalex-extracted
inferredcites →https://doi.org/10.48550/arxiv.2202.00132openalex-extracted
Submodularity In Machine Learning and Artificial Intelligence
inferredcites →https://doi.org/10.5802/aif.53openalex-extracted
Theory of capacities
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.