Sciweavers

IPCO
2008
136views Optimization» more  IPCO 2008»
13 years 6 months ago
Computing with Multi-row Gomory Cuts
Recent advances on the understanding of valid inequalities from the infinite group relaxation has opened the possibility of finding a computationally effective extension to GMI cu...
Daniel G. Espinoza
STOC
1993
ACM
179views Algorithms» more  STOC 1993»
13 years 9 months ago
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 integr...
Cynthia A. Phillips