Trip-based path algorithms using the transit network hierarchy (Q298925): Difference between revisions

@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+A stochastic process approach for frequency-based transit assignment with strict capacity constraints
+Normal rank
@@ Property / cites work @@
+Transit Assignment for Congested Public Transport Systems: An Equilibrium Model
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A strategic model for dynamic traffic assignment
@@ Property / cites work: A strategic model for dynamic traffic assignment / rank @@
+Normal rank
@@ Property / cites work @@
+Public transit corridor assignment assuming congestion due to passenger boarding and alighting
+Normal rank
@@ Property / cites work @@
+A Strategic Flow Model of Traffic Assignment in Static Capacitated Networks
+Normal rank
@@ Property / cites work @@
+Equilibrium traffic assignment for large scale transit networks
+Normal rank
@@ Property / cites work @@
+Implicit Enumeration of Hyperpaths in a Logit Model for Transit Networks
+Normal rank
@@ Property / cites work @@
+A Modeling Framework for Passenger Assignment on a Transport Network with Timetables
+Normal rank
@@ Property / cites work @@
+A Doubly Dynamic Schedule-based Assignment Model for Transit Networks
+Normal rank