On the public citation graph
https://doi.org/10.2139/ssrn.2097765
0 signed · 56 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4613-0215-5_6openalex-extracted
The Modeling Language AIMMS
inferredcites →https://doi.org/10.1007/978-94-011-1134-8openalex-extracted
Interior point approach to linear, quadratic and convex programming: Algorithms and complexity.
inferredcites →https://doi.org/10.1016/0022-247x(91)90145-popenalex-extracted
Certainty equivalents and information measures: Duality and extremal principles
inferredcites →https://doi.org/10.1016/j.orl.2003.12.007openalex-extracted
Robust linear optimization under general norms
inferredcites →https://doi.org/10.1080/10556788.2010.517532openalex-extracted
Automatic robust convex programming
inferredcites →https://doi.org/10.1109/cqr.2014.7152446openalex-extracted
Proceedings [CQR 2014] - Front cover
inferredcites →https://doi.org/10.1137/060650003openalex-extracted
Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets
inferredcites →https://doi.org/10.1137/080734510openalex-extracted
Theory and Applications of Robust Optimization
inferredcites →https://doi.org/10.1137/1.9780898718829openalex-extracted
Lectures on Modern Convex Optimization
inferredcites →https://doi.org/10.1137/1.9781611970791openalex-extracted
Interior-Point Polynomial Algorithms in Convex Programming
inferredcites →https://doi.org/10.1137/s0040585x97983134openalex-extracted
On an Extension of the Notion of f -Divergence
inferredcites →https://doi.org/10.1214/aoms/1177729437openalex-extracted
Asymptotic Theory of Certain "Goodness of Fit" Criteria Based on Stochastic Processes
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/opre.1110.0944openalex-extracted
Robust Optimization Made Easy with ROME
inferredcites →https://doi.org/10.2139/ssrn.1853320openalex-extracted
Immunizing Conic Quadratic Optimization Problems Against Implementation Errors
inferredcites →https://doi.org/10.2139/ssrn.1865208openalex-extracted
Hidden Convexity in Partially Separable Optimization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.1949752openalex-extracted
Robust Counterparts of Inequalities Containing Sums of Maxima of Linear Functions
inferred← citeshttps://doi.org/10.2139/ssrn.1971592openalex-extracted
Safe Approximations of Chance Constraints Using Historical Data
inferred← citeshttps://doi.org/10.2139/ssrn.2148956openalex-extracted
A New Method for Deriving Robust and Globalized Robust Solutions of Uncertain Linear Conic Optimization Problems Having General Convex Uncertainty Sets
inferred← citeshttps://doi.org/10.2139/ssrn.2239581openalex-extracted
Adjustable Robust Parameter Design with Unknown Distributions
inferred← citeshttps://doi.org/10.2139/ssrn.2376660openalex-extracted
Adjustable Robust Optimization with Decision Rules Based on Inexact Revealed Data
inferred← citeshttps://doi.org/10.2139/ssrn.2502825openalex-extracted
Multi-Stage Adjustable Robust Mixed-Integer Optimization via Iterative Splitting of the Uncertainty Set
inferred← citeshttps://doi.org/10.2139/ssrn.2569680openalex-extracted
Robust Longevity Risk Management
inferred← citeshttps://doi.org/10.2139/ssrn.2614985openalex-extracted
Exact Robust Counterparts of Ambiguous Stochastic Constraints Under Mean and Dispersion Information
inferred← citeshttps://doi.org/10.2139/ssrn.2618429openalex-extracted
Globalized Robust Optimization for Nonlinear Uncertain Inequalities
inferred← citeshttps://doi.org/10.2139/ssrn.2665046openalex-extracted
When are Static and Adjustable Robust Optimization with Constraint-Wise Uncertainty Equivalent?
inferred← citeshttps://doi.org/10.2139/ssrn.3666676openalex-extracted
Stochastic Optimization Approaches for Elective Surgery Scheduling and Downstream Capacity Planning: Models, Challenges, and Opportunities
inferred← citeshttps://doi.org/10.2139/ssrn.3829562openalex-extracted
The Analytics of Robust Satisficing: Predict, Optimize, Satisfice, then Fortify
inferred← citeshttps://doi.org/10.2139/ssrn.3990847openalex-extracted
Mean-Covariance Robust Risk Measurement
inferred← citeshttps://doi.org/10.1007/s00158-016-1473-7openalex-snapshot
Variations in the application of a budget of uncertainty optimization approach
inferred← citeshttps://doi.org/10.1007/s10107-014-0842-5openalex-snapshot
Distributionally robust chance constraints for non-linear uncertainties
inferred← citeshttps://doi.org/10.1007/s10479-012-1261-8openalex-snapshot
Robust UAV mission planning
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2021.107618openalex-snapshot
Robust optimization in nanoparticle technology: A proof of principle by quantum dot growth in a residence time reactor
inferred← citeshttps://doi.org/10.1016/j.ejor.2012.10.007openalex-snapshot
Robust counterparts of inequalities containing sums of maxima of linear functions
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.02.018openalex-snapshot
Robust nonlinear optimization with conic representable uncertainty set
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.09.036openalex-snapshot
Recent advances in robust optimization: An overview
inferred← citeshttps://doi.org/10.11121/ijocta.01.2021.00911openalex-snapshot
Performance evaluation for distributionally robust optimization with binary entries
inferred← citeshttps://doi.org/10.11648/j.ajam.20160406.17openalex-snapshot
Robust Optimization for Performance-Based Budget Allocation at Payam Noor University
inferred← citeshttps://doi.org/10.1287/ijoc.1120.0529openalex-snapshot
Safe Approximations of Ambiguous Chance Constraints Using Historical Data
inferred← citeshttps://doi.org/10.17760/d20236918openalex-snapshot
Robust model fitting via convex optimization techniques
inferred← citeshttps://doi.org/10.17760/d20487158openalex-snapshot
Safety quantification for nonlinear and time-delay systems using occupation measures
inferred← citeshttps://doi.org/10.2139/ssrn.5255061openalex-snapshot
Two-Stage Newsvendor Network Problem: A Data-driven Distributionally Robust Optimization Approach
inferred← citeshttps://doi.org/10.53846/goediss-4169openalex-snapshot
A level set approach to integer nonlinear optimization
inferred← citeshttps://doi.org/10.5802/ojmo.15openalex-snapshot
Frameworks and Results in Distributionally Robust Optimization
inferred← citeshttps://doi.org/10.5802/ojmo.38openalex-snapshot
Connections between Robust and Bilevel Optimization
inferred← citeshttps://doi.org/10.59254/sbpo-2019-106717openalex-snapshot
Um algoritmo branch-price-and-cut para o problema de roteamento de veículos com múltiplos entregadores e demanda incerta
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.