Robust path choice in networks with failures

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(200005)35:3<181::AID-NET2>3.0.CO;2-Y" /><181::AID-NET2>3.0.CO;2-Y 10.1002/(SICI)1097-0037(200005)35:3<181::AID-NET2>3.0.CO;2-YzbMath0961.90069OpenAlexW1974982372MaRDI QIDQ4488858

Michael C. Ferris, Ruszczyński, Andrzej

Publication date: 9 July 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(200005)35:3<181::aid-net2>3.0.co;2-y

zbMATH Keywords

stochastic programmingrobust routinglookahead strategiesnetworks with failures

Mathematics Subject Classification ID

Stochastic programming (90C15) Stochastic network models in operations research (90B15) Markov and semi-Markov decision processes (90C40)

Related Items (5)

User equilibrium with recourse ⋮ The dynamic shortest path problem with anticipation ⋮ Dynamic shortest path problems: hybrid routing policies considering network disruptions ⋮ Some equilibrium problems under uncertainty and random variational inequalities ⋮ Dynamic journeying under uncertainty

Uses Software

• GAMS

Cites Work

• Stochastic shortest paths with recourse
• An Analysis of Stochastic Shortest Path Problems
• Day-To-Day Dynamic Network Disequilibria and Idealized Traveler Information Systems
• Stochastic shortest path problems with recourse
• Unnamed Item
• Unnamed Item

This page was built for publication: Robust path choice in networks with failures