Nodal interdiction

DOI10.1016/J.MCM.2011.07.041zbMATH Open1235.90031OpenAlexW4205854255MaRDI QIDQ410061FDOQ410061

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

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A Branch and Bound Algorithm for the Bilevel Programming Problem
• Deterministic network interdiction
• Shortest-path network interdiction
• Solving the bi-objective maximum-flow network-interdiction problem

Cited In (6)

• Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
• Integer Programming Formulations for Minimum Spanning Tree Interdiction
• Interdicting a Nuclear-Weapons Project
• Perfect matching interdiction problem restricted to a stable vertex
• Detecting critical node structures on graphs: A mathematical programming approach
• Two-stage nodal network interdiction under decision-dependent uncertainty

Recommendations

• Title not available (Why is that?) 👍 👎
• Deterministic network interdiction 👍 👎
• Shortest-path network interdiction 👍 👎
• Matching interdiction 👍 👎
• Interdicting a Nuclear-Weapons Project 👍 👎
• Connectivity interdiction 👍 👎
• Interdicting facilities in tree networks 👍 👎
• Nodal intersections and geometric control 👍 👎

This page was built for publication: Nodal interdiction

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