• 作者： 鄧進財
• 作者服務機構： 國立臺灣工業技術學院
• 中文摘要： In this paper, the author presents some the-orems and algorithms for the shortest-path pro-blems with a time constraint. With those al-gorithms, we can also solve the knapsack pro-blem, the dynamic transshipment problem (i. e.,the transshipment problem with a time con-straint), ect. efficiently. Some simple and prac-tical examples are also presented.
• 英文摘要： --
• 中文關鍵字： --
• 英文關鍵字： --