Approximate algorithms for the discrete network design problem
- 28 February 1982
- journal article
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 16 (1) , 45-55
- https://doi.org/10.1016/0191-2615(82)90040-6
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- An efficient approach to solving the road network equilibrium traffic assignment problemPublished by Elsevier ,2002
- Continuous equilibrium network design modelsTransportation Research Part B: Methodological, 1979
- Formulating and solving the network design problem by decompositionTransportation Research Part B: Methodological, 1979
- An Algorithm for the Discrete Network Design ProblemTransportation Science, 1975
- Transport network optimization in the Dutch integral transportation studyTransportation Research, 1974
- Optimal Network Problem: A Branch-and-Bound AlgorithmEnvironment and Planning A: Economy and Space, 1973
- Braess's paradox of traffic flowTransportation Research, 1970
- An algorithm for quadratic programmingNaval Research Logistics Quarterly, 1956