Optimal improvement of networks to nuclear safeguards problems: an alternate view
Networks have been used to model fixed-site security systems and to determine optimal travel routes of thieves or saboteurs. Considered here is the problem of upgrading the security by optimally investing in means to increase the travel time and/or detection probabilities over the arcs of the network. It is shown how to formulate a single linear programming problem to answer the following question. If the cost of increasing travel time is linear for each arc, what is the minimum amount of money one must invest to guarantee that there does not exist a path for thief or saboteur of length less than a fixed time T.
- Research Organization:
- Sandia Labs., Albuquerque, NM (USA)
- DOE Contract Number:
- EY-76-C-04-0789
- OSTI ID:
- 5862078
- Report Number(s):
- SAND-79-1534
- Country of Publication:
- United States
- Language:
- English
Similar Records
Optimal Routing in Time-Varying, Stochastic Networks: Algorithms and Implementations
Solving the discrete network design problem to optimality
Optimal improvement of graphs related to nuclear safeguards problems
Technical Report
·
Fri Aug 01 00:00:00 EDT 1997
·
OSTI ID:1194071
Solving the discrete network design problem to optimality
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36136
Optimal improvement of graphs related to nuclear safeguards problems
Technical Report
·
Mon Aug 01 00:00:00 EDT 1977
·
OSTI ID:5386068