Network interdiction through length-bounded critical disruption paths: a bi-objective approach

DOI10.1016/J.ENDM.2016.03.049zbMath1351.90048OpenAlexW2396284287MaRDI QIDQ325490

Antonino Sgalambro, Donatella Granata

Publication date: 18 October 2016

Full work available at URL: http://eprints.whiterose.ac.uk/126010/1/INOC2015-GRANATA-SGALAMBRO.pdf

zbMATH Keywords

connected componentsmulti-objective programmingmixed integer linear programmingnetwork interdictioncritical disruption path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10)

Related Items (2)

A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem ⋮ Finding the most degree-central walks and paths in a graph: exact and heuristic approaches

Cites Work

• Network interdiction via a critical disruption path: branch-and-price algorithms
• Complexity of the critical node problem over trees
• Exact interdiction models and algorithms for disconnecting networks via node deletions

This page was built for publication: Network interdiction through length-bounded critical disruption paths: a bi-objective approach