ON NETWORK ANALYSIS.
Abstract
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. Floyd's method is then extended to determine all best paths. After a brief review of the nth best path problem, Floyd's 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)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 1968
- Accession Number
- AD0836515
Entities
People
- Robert Joseph Bohls
Organizations
- Naval Postgraduate School