Distributionally robust maximum probability shortest path problem
type: Item
instance of: scholarly article
title: Distributionally robust maximum probability shortest path problem
zbMATH Open document ID: 1485.90082
author: Ali Babapour-Azar
author: Zohreh Hosseini-Noudeh
author: Panos M. Pardalos
author: Rashed Khanjani Shiraz
published in: Journal of Combinatorial Optimization
publication date: 2022-02-14T00:00:00Z
Mathematics Subject Classification ID: 90C17
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7473267
zbMATH Keywords: robust shortest path
zbMATH Keywords: joint chance constrained
zbMATH Keywords: Bonferroni approximation
MaRDI profile type: Publication
full work available at URL: s10878-021-00747-9
OpenAlex ID: W3163690730
cites work: Q3056948
cites work: Q3998396
cites work: Robust solutions of linear programming problems contaminated with uncertain data
cites work: Expected Utility, Penalty Functions, and Duality in Stochastic Nonlinear Programming
cites work: Optimal Inequalities in Probability Theory: A Convex Optimization Approach
cites work: Q5766611
cites work: On distributionally robust chance-constrained linear programs
cites work: From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization
cites work: Maximum probability shortest path problem
cites work: Distributionally Robust Stochastic Knapsack Problem
cites work: Chance constrained \(0-1\) quadratic programs using copulas
cites work: Linear programming under uncertainty
cites work: Finding the k Shortest Paths
cites work: A distributionally robust perspective on uncertainty quantification and chance constrained programming
cites work: Joint chance constrained shortest path problem with Copula theory
cites work: Extended dominance and a stochastic shortest path problem
cites work: Data-driven chance constrained stochastic program
cites work: An approach to the distributionally robust shortest path problem
cites work: Multivariate Chebyshev Inequalities
cites work: Optimal paths in probabilistic networks: A case with temporary preferences
cites work: An exact algorithm for the robust shortest path problem with interval data
cites work: A branch and bound algorithm for the robust shortest path problem with interval data.
cites work: Convex Approximations of Chance Constrained Programs
cites work: Stochastic Shortest Paths Via Quasi-convex Maximization
cites work: Minimizing risk models in stochastic shortest path problems
cites work: Stochastic shortest path problems with associative accumulative criteria
cites work: The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach
cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
cites work: Q4851560
cites work: A distributionally robust joint chance constrained optimization model for the dynamic network design problem under demand uncertainty
cites work: On Deterministic Reformulations of Distributionally Robust Joint Chance Constrained Optimization Problems
cites work: Distributionally robust chance constraints for non-linear uncertainties
cites work: On the robust shortest path problem.
cites work: Distributionally robust joint chance constraints with second-order moment information
DOI: 10.1007/S10878-021-00747-9
description: scientific article; zbMATH DE number 7473267