Accession Number:

AD0646552

Title:

ALL SHORTEST ROUTES FROM A FIXED ORIGIN IN A GRAPH

Descriptive Note:

Technical rept.

Corporate Author:

STANFORD UNIV CA OPERATIONS RESEARCH HOUSE

Report Date:

1966-11-01

Pagination or Media Count:

14.0

Abstract:

A shortest route is sought between a fixed origin to other nodes in a graph when directed arc distances are given which may be positive, negative, or zero. This problem as stated includes the difficult travelling salesman problem. A less difficult problem is considered instead, namely To find a negative cycle in a graph if one exists or if none exists then to find all the shortest paths from the origin. The method is inductive on nodes.

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE