An Active-set Algorithm for Discrete Network Design Problems
Authors:
- 16 June 2009
- book chapter
- Published by Springer Nature
- p. 283-300
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Robust Transportation Network Design Under Demand UncertaintyComputer-Aided Civil and Infrastructure Engineering, 2006
- Selectorecombinative Genetic Algorithm to Relax Computational Complexity of Discrete Network Design ProblemTransportation Research Record: Journal of the Transportation Research Board, 2006
- Bilevel programming for the continuous transport network design problemTransportation Research Part B: Methodological, 2005
- Stochastic Dynamic Network Design ProblemTransportation Research Record: Journal of the Transportation Research Board, 2001
- Models and algorithms for road network design: a review and some new developmentsTransport Reviews, 1998
- An efficient implementation of the “partan” variant of the linear approximation method for the network equilibrium problemNetworks, 1987
- Urban Transportation Network-Equilibrium and Design Models: Recent Achievements and Future ProspectsEnvironment and Planning A: Economy and Space, 1984
- Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decompositionIEEE Transactions on Automatic Control, 1982
- Formulating and solving the network design problem by decompositionTransportation Research Part B: Methodological, 1979
- Optimal Network Problem: A Branch-and-Bound AlgorithmEnvironment and Planning A: Economy and Space, 1973