An improved Algorithm for the shortest path problem with forbidden paths
碩士 === 國立臺灣科技大學 === 資訊管理系 === 95 === The applications of k-shortest paths are very wide, including choosing an actual path in our life, scheduling problems, optimization problems, and so on. The shortest path problem with forbidden paths (SPPFP) considers diverse constrained shortest problems to whi...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/8qq5eg |