Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

STOC
1993
ACM

favoriteEmaildiscussreport

179views Algorithms» more STOC 1993»

The network inhibition problem

13 years 9 months ago

The network inhibition problem

Download www.optimization-online.org

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.

Cynthia A. Phillips

Real-time Traffic

Algorithms | LP Relaxation | Separable Valid Inequalities | STOC 1993 | Valid Inequalities |

claim paper

Related Content

» A stochastic population approach to the problem of stable recruitment hierarchies in spiki...

» Towards a Rational Approach for the Logical Modelling of Inhibition in Metabolic Networks

» Decoupled echo state networks with lateral inhibition

» Finding Dynamic Modules of Biological Regulatory Networks

» Extended model of conditioned learning within latent inhibition

» LogicBased SteadyState Analysis and Revision of Metabolic Networks with Inhibition

» A Pyramidal Neural Network Based on Nonclassical Receptive Field Inhibition

» Abductive Stochastic Logic Programs for Metabolic Network Inhibition Learning

» Decorrelating wireless sensor network traffic to inhibit traffic analysis attacks

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1993
Where	STOC
Authors	Cynthia A. Phillips

Comments (0)