论文信息 - Succesively decomposed networks and their application in discrete programming - 字舞流文

Succesively decomposed networks and their application in discrete programming

Algis Garliauskas | Kestutis Lasinskas

[1] Suleyman Tufekci. Decomposition algorithms for finding the shortest path between a source node and a sink node of a network , 1983 .

[2] J. Ian Munro,et al. Technical Note - Reducing Space Requirements for Shortest Path Problems , 1982, Oper. Res..

[3] Stuart E. Dreyfus,et al. Applied Dynamic Programming , 1965 .