## Improving investment planning in transportation in the case of interdependent projects |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Common terms and phrases

0-D pairs adopted approach aspect assignment technique assumed B/C ratios benefits binary tree branching process budget available budget constraint budget feasible Chapter Characteristics of Network combinatorial problem complete measure completed solution computation costs construction costs context corresponding decrease the computation defined demand determine Dial's algorithm discount rate distribution cost dynamic analysis dynamic program efficiency evaluation example facilities feasible solution final given graph heuristic highway network impacts implemented improvements inflation rate interdependencies investment cost investment planning problem lanes in period large number larger left node Loubal's technique lower bound measure methods mixed integer program network effects nominal budgets Northeast Corridor number of alternatives number of configurations number of possible number of projects optimal sequence optimum solution parameters particular performance phase planning agencies represents right node second application shortest path solution set specific static procedure Sweeney and Tatham total cost total travel transportation costs various