The network inhibition problem

We study the Maximum Flow Network Interdiction Problem (MFNIP). We present two classes of polynomially separable valid inequalities for Cardinality MFNIP. We also prove the integrality gap of the LP relaxation of Wood’s [19] integer program is not bounded by a constant factor, even when the LP relaxation is strengthened by our valid inequalities. Finally, we provide an approximation-factor-preserving reduction from the simpler R-Interdiction Covering Problem to MFNIP.

• Type: Conference
• Year: 1993
• Where: STOC
• Authors: Cynthia A. Phillips
• Keywords: Algorithms, LP Relaxation, Separable Valid Inequalities, STOC 1993, Valid Inequalities