Maximum probability shortest path problem

DOI10.1016/j.dam.2014.05.009zbMath1319.05078OpenAlexW2041817517MaRDI QIDQ491594

Jianqiang Cheng, Abdel Lisser

Publication date: 18 August 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.05.009

zbMATH Keywords

stochastic programmingbranch and boundsecond-order cone programmingresource constrained shortest path

Mathematics Subject Classification ID

Stochastic programming (90C15) Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (10)

Distributionally Robust Optimization with Principal Component Analysis ⋮ Extreme value distributions for two kinds of path sums of Markov chain ⋮ A fully polynomial time approximation scheme for the probability maximizing shortest path problem ⋮ Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings ⋮ Joint chance constrained shortest path problem with Copula theory ⋮ A traveling salesman problem with pickups and deliveries and stochastic travel times: an application from chemical shipping ⋮ Optimization algorithms for resilient path selection in networks ⋮ General sum games with joint chance constraints ⋮ Partial sample average approximation method for chance constrained problems ⋮ Distributionally robust maximum probability shortest path problem

Uses Software

• SeDuMi
• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Extended dominance and a stochastic shortest path problem
• Convexity of chance constraints with independent random variables
• A heuristic approach to hard constrained shortest path problems
• The shortest path problem with two objective functions
• Optimal paths in probabilistic networks: A case with temporary preferences
• Minimizing risk models in stochastic shortest path problems
• A second-order cone programming approach for linear programs with joint probabilistic constraints
• A penalty function heuristic for the resource constrained shortest path problem
• Stochastic shortest path problems with associative accumulative criteria
• The shortest route problem with constraints
• Models and algorithm for stochastic shortest path problem
• On a routing problem
• Shortest chain subject to side constraints
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• An algorithm for the resource constrained shortest path problem
• Approximation Schemes for the Restricted Shortest Path Problem
• Error Analysis for Convex Separable Programs: The Piecewise Linear Approximation and The Bounds on The Optimal Objective Value
• A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• A polynomial-time algorithm to find shortest paths with recourse
• Stochastic shortest path problems with recourse
• The network inhibition problem
• Stochastic Shortest Paths Via Quasi-convex Maximization

This page was built for publication: Maximum probability shortest path problem