Nodal interdiction

DOI10.1016/j.mcm.2011.07.041zbMath1235.90031OpenAlexW4205854255MaRDI QIDQ410061

Kevin T. Kennedy, Richard F. Deckro, James T. Moore, Kenneth M. Hopkinson

Publication date: 15 April 2012

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2011.07.041

zbMATH Keywords

networksbilevel programminginterdiction

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Deterministic network models in operations research (90B10)

Related Items (4)

Integer Programming Formulations for Minimum Spanning Tree Interdiction ⋮ Detecting critical node structures on graphs: A mathematical programming approach ⋮ Perfect matching interdiction problem restricted to a stable vertex ⋮ Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire

Cites Work

• Unnamed Item
• Unnamed Item
• Deterministic network interdiction
• Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
• A Branch and Bound Algorithm for the Bilevel Programming Problem
• Shortest-path network interdiction

This page was built for publication: Nodal interdiction