ON NETWORK ANALYSIS.
NAVAL POSTGRADUATE SCHOOL MONTEREY CALIF
Pagination or Media Count:
The thesis reviews four of the existing matrix methods for finding the shortest path in a network, including the little known matrix method by Floyd. Floyds method is then extended to determine all best paths. After a brief review of the nth best path problem, Floyds method is again extended to determine the nth best path. Finally, the nth best path problem is investigated to determine its applicability to the traveling salesman problem. Author
- Operations Research
- Computer Programming and Software
- Computer Systems