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

DOI10.1016/J.ENDM.2016.03.049zbMATH Open1351.90048OpenAlexW2396284287MaRDI QIDQ325490FDOQ325490

Authors: Donatella Granata, Antonino Sgalambro 

Publication date: 18 October 2016

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

Recommendations

• Network interdiction via a critical disruption path: branch-and-price algorithms
• Network interdiction and stochastic integer programming
• Bi-objective optimization models for network interdiction
• A decomposition approach for stochastic shortest-path network interdiction with goal threshold
• Assessing the effectiveness of \(k\)-shortest path sets in problems of network interdiction
• Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks
• Shortest path network interdiction with asymmetric information
• scientific article; zbMATH DE number 2050723
• Shortest-path network interdiction
• A dynamic network interdiction problem

zbMATH Keywords

mixed integer linear programmingmulti-objective programmingconnected componentsnetwork interdictioncritical disruption path

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• Shortest path network interdiction with asymmetric information
• Finding the most degree-central walks and paths in a graph: exact and heuristic approaches
• Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks
• A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem
• Interdicting restructuring networks with applications in illicit trafficking
• Network interdiction via a critical disruption path: branch-and-price algorithms
• Optimal \(K\)-node disruption on a node-capacitated network

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q325490)