Servicios Personalizados
Revista
Articulo
Indicadores
Citado por SciELO
Accesos
Links relacionados
Similares en SciELO
Compartir
Revista de la Facultad de Ingeniería Universidad Central de Venezuela
versión impresa ISSN 0798-4065
Resumen
HERNANDEZ, Sara; ROCCO, Claudio; RAMIREZ-MARQUEZ, Jose y GONZALEZ, Belzyt. A heuristic for the deterministic interdiction problem. Rev. Fac. Ing. UCV [online]. 2009, vol.24, n.3, pp.5-20. ISSN 0798-4065.
This paper introduces a new heuristic approach that can be readily applied to solve deterministic network interdiction problems (DNIP). The network interdiction problem solved considers the minimization of the maximum flow that can be transmitted between a source node and a sink node for a fixed network design when there is a limited amount of resources available to interdict network links. Examples for different network topologies are used throughout the paper to illustrate the approach. In terms of computational effort, the results illustrate that excellent solutions are obtained from a significantly reduced solution search space
Palabras clave : Heuristic; Deterministic interdiction; Networks; Algorithm; Search space; Maximum flow.