Pages that link to "Item:Q5449558"
From MaRDI portal
The following pages link to Stochastic Shortest Paths Via Quasi-convex Maximization (Q5449558):
Displayed 30 items.
- Finding reliable shortest paths in road networks under uncertainty (Q264260) (← links)
- Distance oracles for time-dependent networks (Q289929) (← links)
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- New reformulations of distributionally robust shortest path problem (Q342487) (← links)
- Possibilistic bottleneck combinatorial optimization problems with ill-known weights (Q433509) (← links)
- On the complexity of time-dependent shortest paths (Q476455) (← links)
- Maximum probability shortest path problem (Q491594) (← links)
- Constrained shortest path with uncertain transit times (Q496598) (← links)
- Stochastic shortest path with unlimited hops (Q976100) (← links)
- A traveling salesman problem with pickups and deliveries and stochastic travel times: an application from chemical shipping (Q1749489) (← links)
- A fully polynomial-time approximation scheme for approximating a sum of random variables (Q1785211) (← links)
- Distributionally robust maximum probability shortest path problem (Q2075464) (← links)
- An approximation algorithm for a general class of multi-parametric optimization problems (Q2082173) (← links)
- An approximation algorithm for a general class of parametric optimization problems (Q2156299) (← links)
- Joint chance constrained shortest path problem with Copula theory (Q2185821) (← links)
- Dynamic journeying under uncertainty (Q2253524) (← links)
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra (Q2281450) (← links)
- Equilibrium routing under uncertainty (Q2349119) (← links)
- Algorithms for non-linear and stochastic resource constrained shortest path (Q2417959) (← links)
- A fully polynomial time approximation scheme for the probability maximizing shortest path problem (Q2670558) (← links)
- Routing Optimization Under Uncertainty (Q2806069) (← links)
- Additive Consistency of Risk Measures and Its Application to Risk-Averse Routing in Networks (Q2833115) (← links)
- A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times (Q2875605) (← links)
- Robust Adaptive Routing Under Uncertainty (Q4969320) (← links)
- Computing Constrained Shortest-Paths at Scale (Q5031006) (← links)
- Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs (Q5076726) (← links)
- Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480) (← links)
- Risk-Averse Selfish Routing (Q5219707) (← links)
- Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems (Q5219721) (← links)
- Parametric matroid interdiction (Q6122085) (← links)