Una heurística para el problema de interdicción determinística

Translated title of the contribution: A heuristic for the deterministic interdiction problem

Claudio Rocco, Sara Hernández, José Ramírez-Márquez, Belzyt González

    Research output: Contribution to journalArticlepeer-review

    Abstract

    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.

    Translated title of the contributionA heuristic for the deterministic interdiction problem
    Original languageSpanish
    Pages (from-to)5-20
    Number of pages16
    JournalRevista de la Facultad de Ingenieria
    Volume24
    Issue number3
    StatePublished - Sep 2009

    Keywords

    • Algorithm
    • Deterministic interdiction
    • Heuristic
    • Maximum flow
    • Networks
    • Search space

    Fingerprint

    Dive into the research topics of 'A heuristic for the deterministic interdiction problem'. Together they form a unique fingerprint.

    Cite this