Maximizing reserve capacity for a signalized road network design problem.
Suh-Wen ChiouPublished in: ITSC (2006)
Keyphrases
- network design problem
- transportation networks
- approximation algorithms
- network design
- road network
- benders decomposition
- mixed integer
- branch and bound
- mixed integer programming
- minimal cost
- traveling salesman problem
- travel time
- integer programming
- lagrangian relaxation
- special case
- exact solution
- neural network
- lower bound