Maximum dynamic network flow interdiction problem: New formulation and solution procedures
- 31 August 2013
- journal article
- Published by Elsevier BV in Computers & Industrial Engineering
- Vol. 65 (4), 531-536
- https://doi.org/10.1016/j.cie.2013.04.014
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- The multi-terminal maximum-flow network-interdiction problemEuropean Journal of Operational Research, 2011
- The Maximum Flow Network Interdiction Problem: Valid inequalities, integrality gaps, and approximabilityOperations Research Letters, 2010
- Identifying Critical Infrastructure: The Median and Covering Facility Interdiction ProblemsAnnals of the American Association of Geographers, 2004
- Shortest‐path network interdictionNetworks, 2002
- Stochastic Network InterdictionOperations Research, 1998
- Finding the most vital arcs in a networkOperations Research Letters, 1989
- A network interdiction model for hospital infection controlComputers in Biology and Medicine, 1987
- Most vital links and nodes in weighted networksOperations Research Letters, 1982
- A problem in network interdictionNaval Research Logistics Quarterly, 1978
- Maximizing the minimum source-sink path subject to a budget constraintMathematical Programming, 1977