A mixed-integer programming approach for locating jamming devices in a flow-jamming attack

DOI10.1016/j.cor.2018.02.020zbMath1458.90177OpenAlexW2789683754MaRDI QIDQ1652633

David Schweitzer, Burak Eksioglu, Satish Vadlamani, Apurba K. Nandi, Hugh R. Medal

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.02.020

zbMATH Keywords

OR in telecommunicationsBenders' decompositionflow-jamming attacksjamming device placement problemOR in defense

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (2)

Radio communications interdiction problem under deterministic and probabilistic jamming ⋮ An L-shaped method with strengthened lift-and-project cuts

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Network interdiction via a critical disruption path: branch-and-price algorithms
• A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
• The \(r\)-interdiction median problem with probabilistic protection and its solution algorithm
• A bi-level programming model for protection of hierarchical facilities under imminent attacks
• Methods for removing links in a network to minimize the spread of infections
• Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model
• Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
• Revisiting wireless network jamming by SIR-based considerations and multiband robust optimization
• Interdiction problems on planar graphs
• Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
• Network flow interdiction on planar graphs
• Detecting critical nodes in sparse graphs
• Partitioning procedures for solving mixed-variables programming problems
• A bilevel fixed charge location model for facilities under imminent attack
• Deterministic network interdiction
• The wireless network jamming problem
• A bilevel mixed-integer program for critical infrastructure protection planning
• Jamming communication networks under complete uncertainty
• A stochastic programming approach for supply chain network design under uncertainty
• Stochastic Network Interdiction
• Interdicting a Nuclear-Weapons Project
• When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
• Robust Wireless Network Jamming Problems
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• The wireless network jamming problem subject to protocol interference
• Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
• Shortest-path network interdiction
• Accelerating benders decomposition with heuristicmaster problem solutions

This page was built for publication: A mixed-integer programming approach for locating jamming devices in a flow-jamming attack