A Lagrangian Heuristic for solving a network interdiction problem
This thesis is concerned with solving or approximately solving a maximum-flow network-interdiction problem denoted MXFI: A network user strives to maximize flow of a commodity through a capacitated network, while an interdictor, with limited assets, attempts to destroy links in the network to minimi...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
Monterey, California. Naval Postgraduate School
2012
|
| Online Access: | http://hdl.handle.net/10945/1385 |