Stochastic Shortest Paths Via Quasi-convex Maximization
DOI10.1007/11841036_50zbMATH Open1131.05317OpenAlexW2122967662MaRDI QIDQ5449558FDOQ5449558
Authors: E. Nikolova, Jonathan Kelner, Matthew Brand, Michael Mitzenmacher 
Publication date: 11 March 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11841036_50
Recommendations
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)
Cited In (35)
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
- Finding reliable shortest paths in road networks under uncertainty
- A mean-risk model for the traffic assignment problem with stochastic travel times
- Risk-averse selfish routing
- Stochastic shortest path with unlimited hops
- A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems
- Approximation algorithms for stochastic combinatorial optimization problems
- Possibilistic bottleneck combinatorial optimization problems with ill-known weights
- Parametric computation of minimum-cost flows with piecewise quadratic costs
- Dynamic journeying under uncertainty
- Computing constrained shortest-paths at scale
- On the complexity of time-dependent shortest paths
- Routing optimization under uncertainty
- Robust adaptive routing under uncertainty
- The Value of Side Information in Shortest Path Optimization
- Additive consistency of risk measures and its application to risk-averse routing in networks
- Energy of convex sets, shortest paths, and resistance
- Algorithms for non-linear and stochastic resource constrained shortest path
- A multi-objective approach for PH-graphs with applications to stochastic shortest paths
- A traveling salesman problem with pickups and deliveries and stochastic travel times: an application from chemical shipping
- A fully polynomial-time approximation scheme for approximating a sum of random variables
- A fully polynomial time approximation scheme for the probability maximizing shortest path problem
- Equilibrium routing under uncertainty
- New reformulations of distributionally robust shortest path problem
- Constrained shortest path with uncertain transit times
- An approximation algorithm for a general class of parametric optimization problems
- Joint chance constrained shortest path problem with Copula theory
- Technical Note—A Note on the Stochastic Shortest Route Problem
- Maximum probability shortest path problem
- Distributionally robust maximum probability shortest path problem
- An approximation algorithm for a general class of multi-parametric optimization problems
- Wasserstein distributionally robust shortest path problem
- Parametric matroid interdiction
- Maximizing expected utility for stochastic combinatorial optimization problems
This page was built for publication: Stochastic Shortest Paths Via Quasi-convex Maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449558)
