Non-Convex Traffic Assignment on a Rectangular Grid Network

DOI10.1287/TRSC.30.1.32zbMATH Open0851.90043OpenAlexW2158413645MaRDI QIDQ4889775FDOQ4889775

Authors: Gordon Frank Newell 

Publication date: 25 November 1996

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.30.1.32

Recommendations

• scientific article; zbMATH DE number 2159152
• Nonlinear cost network models in transportation analysis
• Network flow assignment as a fixed point problem
• The Traffic Equilibrium Problem with Nonadditive Path Costs
• A partial linearization method for the traffic assignment problem

zbMATH Keywords

idealized infinite rectangular grid of roads

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Cited In (1)

• Non-additive shortest path in the context of traffic assignment

This page was built for publication: Non-Convex Traffic Assignment on a Rectangular Grid Network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4889775)