Implicit enumeration of hyperpaths in a logit model for transit networks
From MaRDI portal
Cited in
(11)- Computing and listing \(st\)-paths in public transportation networks
- Finding optimal hyperpaths in large transit networks with realistic headway distributions
- Hybrid evolutionary metaheuristics for concurrent multi-objective design of urban road and public transit networks
- Effects of countdown displays in public transport route choice under severe overcrowding
- Trip-based path algorithms using the transit network hierarchy
- Bi-objective bimodal urban road network design using hybrid metaheuristics
- Whitney's connectivity inequalities for directed hypergraphs
- Directed hypergraphs: introduction and fundamental algorithms -- a survey
- On the complexity of strongly connected components in directed hypergraphs
- Models and Software for Urban and Regional Transportation Planning: The Contributions of the Center for Research on Transportation
- Stochastic user equilibrium assignment in schedule-based transit networks with capacity constraints
This page was built for publication: Implicit enumeration of hyperpaths in a logit model for transit networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2783794)