A route set construction algorithm for the transit network design problem.
Antonio MauttoneMaría E. UrquhartPublished in: Comput. Oper. Res. (2009)
Keyphrases
- network design problem
- cost function
- np hard
- knapsack problem
- expectation maximization
- optimal solution
- lower and upper bounds
- integer programming
- mathematical model
- dynamic programming
- computational complexity
- objective function
- energy function
- constraint satisfaction problems
- convex hull
- convergence rate
- probabilistic model