Distributionally robust maximum probability shortest path problem
From MaRDI portal
Publication:2075464
DOI10.1007/s10878-021-00747-9zbMath1485.90082OpenAlexW3163690730MaRDI QIDQ2075464
Zohreh Hosseini-Noudeh, Panos M. Pardalos, Ali Babapour-Azar, Rashed Khanjani Shiraz
Publication date: 14 February 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-021-00747-9
Related Items
Distributionally robust joint chance-constrained programming: Wasserstein metric and second-order moment constraints, Robust chance-constrained geometric programming with application to demand risk mitigation, Distributionally robust joint chance-constrained support vector machines, On the multistage shortest path problem under distributional uncertainty
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A distributionally robust joint chance constrained optimization model for the dynamic network design problem under demand uncertainty
- Data-driven chance constrained stochastic program
- Maximum probability shortest path problem
- Chance constrained \(0-1\) quadratic programs using copulas
- Extended dominance and a stochastic shortest path problem
- Optimal paths in probabilistic networks: A case with temporary preferences
- Minimizing risk models in stochastic shortest path problems
- On the robust shortest path problem.
- A branch and bound algorithm for the robust shortest path problem with interval data.
- Robust solutions of linear programming problems contaminated with uncertain data
- The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach
- An exact algorithm for the robust shortest path problem with interval data
- Distributionally robust joint chance constraints with second-order moment information
- Joint chance constrained shortest path problem with Copula theory
- A distributionally robust perspective on uncertainty quantification and chance constrained programming
- On distributionally robust chance-constrained linear programs
- Stochastic shortest path problems with associative accumulative criteria
- An approach to the distributionally robust shortest path problem
- Linear Programming under Uncertainty
- Distributionally Robust Stochastic Knapsack Problem
- Expected Utility, Penalty Functions, and Duality in Stochastic Nonlinear Programming
- From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization
- Finding the k Shortest Paths
- On Deterministic Reformulations of Distributionally Robust Joint Chance Constrained Optimization Problems
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- Convex Approximations of Chance Constrained Programs
- Stochastic Shortest Paths Via Quasi-convex Maximization
- Multivariate Chebyshev Inequalities
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Distributionally robust chance constraints for non-linear uncertainties
