Recommendations
Cites work
- scientific article; zbMATH DE number 4112412 (Why is no real title available?)
- scientific article; zbMATH DE number 1488064 (Why is no real title available?)
- A Strategic Flow Model of Traffic Assignment in Static Capacitated Networks
- A note on the stochastic shortest-route problem
- A strategic model for dynamic traffic assignment
- Adaptive least-expected time paths in stochastic, time-varying transportation and data networks
- An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays
- Day-To-Day Dynamic Network Disequilibria and Idealized Traveler Information Systems
- Dynamic Systems, Variational Inequalities and Control Theoretic Models for Predicting Time-Varying Urban Network Flows
- On the online shortest path problem with limited arc cost dependencies
- Origin-Based Algorithm for the Traffic Assignment Problem
- Robust path choice in networks with failures
- Stochastic shortest path problems with recourse
- Stochastic shortest paths with recourse
Cited in
(9)- Obtaining Network Cost(s) from One Link's Output
- Linear programming formulation for strategic dynamic traffic assignment
- Arrival time reliability in strategic user equilibrium
- Range-constrained traffic assignment with multi-modal recharge for electric vehicles
- Dynamic flows with adaptive route choice
- On the equivalence between SUE and fixed-point states of day-to-day assignment processes with serially-correlated route choice
- Adaptive park-and-ride choice on time-dependent stochastic multimodal transportation network
- Stochastic ridesharing user equilibrium in transport networks
- An \(N\)-path user equilibrium for transportation networks
This page was built for publication: User equilibrium with recourse
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844138)
