The Routing Problem with "K" Specified Nodes
暂无分享，去创建一个
The functional equation technique has been employed to solve more general "routing" problems, when the route must pass through a number of specified nodes. The method is illustrated by an example.
[1] Richard Bellman,et al. ON A ROUTING PROBLEM , 1958 .
[2] Paul H. Randolph,et al. Letter to the Editor—The Shortest-Route Problem , 1960 .
[3] Maurice Pollack,et al. SOLUTIONS OF THE SHORTEST-ROUTE PROBLEM-A REVIEW , 1960 .
[4] G. Dantzig. Discrete-Variable Extremum Problems , 1957 .
[5] Richard Bellman,et al. Dynamic Programming Treatment of the Travelling Salesman Problem , 1962, JACM.