참고문헌
- Operations Research v.32 Determining all optimal and near optimal solutions when solving shortest path problems by dynamic programming Byers,T.H.;Waterman,M.S.
- Dynamic Programming : Models and Application Denardo,E.V.
- Operations Research v.27 Shortest-route methods : 1. reaching, pruning, and buckets Denardo,E.V.;Fox,B.L.
- Operations Research v.17 An appraisal of some shortest-path algorithms Dreyfus,S.E.
- Operation Research v.21 Sequencing expansion projects Erlenketter,D.
- Networks v.11 A note on the problem of updating shortest paths Fujishige,S.
- Networks v.8 A new shortest path updating algoritgm Goto,S.;Sangiovanni-Vincentelli, A.
- Networks v.13 A note on arc tolerances in sparse shortest-path and network flow problems Gusfield,D.
- J. of Korean OR/MS Society v.12 Sensitivity analysis for production planning problems with backlogging Lee,I.S.
- J. of Korean OR/MS Society v.13 Sensitivity analysis of project sequencing problems Lee,I.S.
- U.S.S.R. Compluational Mathematics and Mathematical Physics v.8 The parametric problem of shortest distances Rodionov,V.
- Networks v.10 Arc tolerances in shortest path and network flow algorithms Shier,D.R.;Witzgall,G.
- SIAM J. Computing v.4 On finding and updating spanning trees and shortest paths Spira,P.M.;Pan,A.
- Information Processing Letters v.14 Sensitivity analysis of minimum spanning trees and shortest path trees Tarjan,R.E.
- Principles of Operation Research(2nd ed.) Wagner,H.M.
- Management Science v.13 A deterministic multiperiod production scheduling model with backloggong Zangwill,W.L.