Determining All Optimal and Near-Optimal Solutions When Solving Shortest Path Problems by Dynamic Programming
Thomas H. Byers and Michael S. WatermanVolume:
32
Language:
english
Journal:
Operations Research
DOI:
10.2307/170956
Date:
November, 1984
File:
PDF, 316 KB
english, 1984