Books about Interdicting from Amazon.com

This is a NAVAL POSTGRADUATE SCHOOL MONTEREY CA report procured by the Pentagon and made available for public release It has been reproduced in the best form available to the Pentagon. It is not spiral-bound, but rather assembled with Velobinding in a soft, white linen cover. The Storming Media report number is A361224. The abstract provided by the Pentagon follows: This thesis explores Benders decomposition for solving interdiction problems on electric power grids, with applications to analyzing the vulnerability of such grids to terrorist attacks We refine and extend some existing optimization models and algorithms and demonstrate the value of our techniques using standard reliability test networks from IEEE Our implementation of Benders decomposition optimally solves any problem instance, in theory However, run times increase as Benders' cuts are added to the master problem, and this has prompted additional research to increase the decomposition's efficiency We demonstrate empirical speed ups by dropping slack cuts, solving a relaxed master problem in some iterations, and using integer but not necessarily optimal master-problem solutions These mixed strategies drastically reduce computation times For example, in one test case, we reduce the optimality gap, and the time that it takes to achieve this gap, from 16% in 75 hours to 5% in 16 minutes..
Price: $28.95 [Notify me when price goes down.]

This is a NAVAL POSTGRADUATE SCHOOL MONTEREY CA report procured by the Pentagon and made available for public release It has been reproduced in the best form available to the Pentagon. It is not spiral-bound, but rather assembled with Velobinding in a soft, white linen cover. The Storming Media report number is A695143. The abstract provided by the Pentagon follows: A network interdictor' has a limited supply of resource with which to disrupt a network user's" flow of supplies in a capacitated transshipment network. The interdictor's problem of minimizing the maximum flow through the network is a difficult- to-solve integer programming problem but we show that a heuristic based on Lagrangian relaxation is very effective in approximately solving the problem. We implement algorithms in C to approximately solve both the static (without considering time) and dynamic network interdiction problems. Static test networks range in size from 25 nodes and 64 arcs to 400 nodes and 1519 arcs. Using an IBM Rs/6000 Model 590 workstation, we find optimal solutions for seven of 12 test networks and solve the largest problem in only 31.0 seconds. We model a dynamic network in time-expanded form in order to assign time weights of 0 or 1 to flow, include repair time of interdicted arcs, and provide a schedule to the network interdictor that identifies arcs and time periods for interdictions. Dynamic networks range in size from 525 nodes and 1, 344 arcs to 40,400 nodes and 153,419 arcs (in time-expanded form). We find near- optimal solutions in 13 of 24 test networks and solve the largest network in 1729.5 seconds..
Price: $29.95 [Notify me when price goes down.]