Optimal improvement of graphs related to nuclear safeguards problems
Technical Report
·
OSTI ID:5386068
This report develops the methodology for optimally improving graphs related to nuclear safeguards issues. In particular, given a fixed number of dollars, the report provides a method for optimally allocating such dollars over the arcs of a weighted graph (the weights vary as a function of dollars spent on arcs) so as to improve the system effectiveness measure which is the shortest of all shortest paths to several targets. Arc weights can be either clock times or detection probabilities and the algorithm does not explicitly consider all paths to the targets.
- Research Organization:
- Sandia Labs., Albuquerque, N.Mex. (USA)
- DOE Contract Number:
- EY-76-C-04-0789
- OSTI ID:
- 5386068
- Report Number(s):
- SAND-76-0435
- Country of Publication:
- United States
- Language:
- English
Similar Records
Region adjacency graph in sabotage studies
KSPTH: a subroutine for the K shortest paths in a sabotage graph
Optimal improvement of networks to nuclear safeguards problems: an alternate view
Technical Report
·
Fri Oct 01 00:00:00 EDT 1976
·
OSTI ID:7247233
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
Optimal improvement of networks to nuclear safeguards problems: an alternate view
Technical Report
·
Wed Aug 01 00:00:00 EDT 1979
·
OSTI ID:5862078