A computational study of path-based methods for optimal traffic assignment with both inelastic and elastic demand (Q1634068): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2018.11.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2901572114
@@ Property / OpenAlex ID: W2901572114 / rank @@
+Normal rank
@@ Property / cites work @@
+Origin-Based Algorithm for the Traffic Assignment Problem
+Normal rank
@@ Property / cites work @@
+Traffic assignment problem for a general network
@@ Property / cites work: Traffic assignment problem for a general network / rank @@
+Normal rank
@@ Property / cites work @@
+A convergent and efficient decomposition method for the traffic assignment problem
+Normal rank
@@ Property / cites work @@
+Q5687197
@@ Property / cites work: Q5687197 / rank @@
+Normal rank
@@ Property / cites work @@
+Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
+Normal rank
@@ Property / cites work @@
+On the convergence of descent methods for monotone variational inequalities
+Normal rank
@@ Property / cites work @@
+A framework for and empirical study of algorithms for traffic assignment
+Normal rank
@@ Property / cites work @@
+The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
+Normal rank
@@ Property / cites work @@
+A modified gradient projection algorithm for solving the elastic demand traffic assignment problem
+Normal rank