A mixed integer knapsack model for allocating funds to highway safety improvements
暂无分享,去创建一个
[1] Emanuel Melachrinoudis,et al. A branch & bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints , 2004, Comput. Oper. Res..
[2] Kumares C. Sinha,et al. OPTIMAL ALLOCATION OF FUNDS FOR HIGHWAY SAFETY IMPROVEMENT PROJECTS , 1981 .
[3] K S Opiela. EVALUATING THE EFFECTIVENESS OF HIGHWAY SAFETY IMPROVEMENTS , 1986 .
[4] Prabhakant Sinha,et al. The Multiple-Choice Knapsack Problem , 1979, Oper. Res..
[5] G A Donaldson. Safety Spending: Usually Begrudged, Often Misallocated , 1988 .
[6] K C Sinha,et al. ASSESSMENT OF SAFETY IMPACTS OF HIGHWAY PROJECTS , 1986 .
[7] George B. Dantzig,et al. Linear programming and extensions , 1965 .
[8] Barbara McCann,et al. Changing Direction: Federal Transportation Spending in the 1990's , 2000 .
[9] R E Skinner. RRR DESIGN STANDARDS: COST-EFFECTIVENESS ISSUES , 1986 .
[10] Edward Y. H. Lin,et al. A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems , 1998 .
[11] Kenneth W. Gish,et al. SYNTHESIS OF HUMAN FACTORS RESEARCH ON OLDER DRIVERS AND HIGHWAY SAFETY. VOLUME II: HUMAN FACTORS AND HIGHWAY SAFETY RESEARCH SYNTHESIS , 1997 .
[12] Kumares C. Sinha,et al. Optimization Approach to Highway Safety Improvement Programming , 1998 .
[13] David B. Brown,et al. The use of dynamic programming in optimally allocating funds for highway safety improvements , 1980 .
[14] Ellis L. Johnson,et al. A note of the knapsack problem with special ordered sets , 1981, Oper. Res. Lett..