A ''STRING ALGORITHM'' FOR SHORTEST PATHS IN DIRECTED NETWORKS

reportActive / Technical Report | Accession Number: AD0427378 | Open PDF

Abstract:

A simple cutting procedure is described which can be combined with any algorithm for undirected networks symmetric distance matrix so as to form a shortest-path algorithm for directed networks asymmetric distance matrix. In particular, the cutting and stretching can be alternated to form a string algorithm for directed networks.

Author(s):
Klee, Victor
Author Organization(s):
BOEING SCIENTIFIC RESEARCH LABS SEATTLE WA
Supplementary Note:
DOI: 10.21236/AD0427378
Pagination:
0011

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release
Distribution Statement:
Approved For Public Release; Distribution Is Unlimited.

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
D1-82-0319, MATHEMATICAL NOTE NO. 333
Monitor Series:
XD
 Subject Terms
Joint Capability Areas:
JCA_6.1_Information Transport; JCA_6_Net Centric
Communities of Interest:
No COI(s) Identified
Descriptor(s):
*NETWORKS, DYNAMIC PROGRAMMING, OPTIMIZATION
Field(s)/Group(s):
Numerical Mathematics
Keyword(s):
pert, shortest route problem
Report Date:
1963 Nov 01