A bilevel exposure-oriented sensor location problem for border security

DOI10.1016/J.COR.2018.05.017zbMath1391.90383OpenAlexW2804650698WikidataQ115062372 ScholiaQ115062372MaRDI QIDQ1651642

Aaron M. Lessin, Raymond R. Hill, Brian J. Lunday

Publication date: 12 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.05.017

zbMATH Keywords

bilevel programmingwireless sensor networksbarrier coverageborder surveillanceminimal exposure path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Continuous location (90B85) Nonlinear programming (90C30) Discrete location and assignment (90B80)

Related Items (4)

A discrete optimisation approach for target path planning whilst evading sensors ⋮ Counterfactual regret minimization for integrated cyber and air defense resource allocation ⋮ Logic-based Benders decomposition algorithm for contamination detection problem in water networks ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• The gradual covering decay location problem on a network.
• Optimal sensor deployment to increase the security of the maximal breach path in border surveillance
• Deterministic network interdiction
• A heuristic algorithm for minimax sensor location in the plane
• An overview of bilevel optimization
• The gradual covering problem
• The generalized maximal covering location problem

This page was built for publication: A bilevel exposure-oriented sensor location problem for border security