Pathfinding in graph-theoretic sabotage models. I. Simultaneous attack by several teams
Technical Report
·
OSTI ID:7341740
Graph models are developed for fixed-site safeguards systems. The problem of finding optimal routes for several sabotage teams is cast as a problem of finding shortest paths in a graph. The motivation, rationale, and interpretation of the mathematical models are discussed in detail, and an algorithm for efficiently solving the associated path problem is described.
- Research Organization:
- Sandia Labs., Albuquerque, N.Mex. (USA)
- DOE Contract Number:
- AT(29-1)-789
- OSTI ID:
- 7341740
- Report Number(s):
- SAND-76-0314
- Country of Publication:
- United States
- Language:
- English
Similar Records
SPTH3: subroutine for finding shortest sabotage paths
KSPTH: a subroutine for the K shortest paths in a sabotage graph
Region adjacency graph in sabotage studies
Technical Report
·
Fri Jul 01 00:00:00 EDT 1977
·
OSTI ID:7089490
KSPTH: a subroutine for the K shortest paths in a sabotage graph
Technical Report
·
Mon Aug 01 00:00:00 EDT 1977
·
OSTI ID:7085571
Region adjacency graph in sabotage studies
Technical Report
·
Fri Oct 01 00:00:00 EDT 1976
·
OSTI ID:7247233