Scheduling bodyguards
From MaRDI portal
Cites work
- A hide–search game
- A Multiple Dispatch Queueing Model of Police Patrol Operations
- A Patrol Car Allocation Model: Capabilities and Algorithms
- A Queuing-Linear Programming Approach to Scheduling Police Patrol Cars
- A review of attacker-defender games: current state and paths forward
- A search game on a hypergraph with booby traps
- An N Server Cutoff Priority Queue Where Arriving Customers Request a Random Number of Servers
- Applying variance reduction ideas in queuing simulations
- Balancing Terrorism and Natural Disasters—Defensive Strategy with Endogenous Attacker Effort
- Determining optimal police patrol areas with maximal covering and backup covering location models
- Fifty years of operations research in defense
- Fighting Pickpocketing using a Choice-based Resource Allocation Model
- Hybrid defensive resource allocations in the face of partially strategic attackers in a sequential defender-attacker game
- Location-allocation models for traffic police patrol vehicles on an interurban network
- Modeling a multitarget attacker-defender game with budget constraints
- Network inspection for detecting strategic attacks
- Optimal resource allocation for security in reliability systems
- Stackelberg production-protection games: defending crop production against intentional attacks
- Strategic defense and attack for series and parallel reliability systems
- Technical note -- Optimal patrol of a perimeter
This page was built for publication: Scheduling bodyguards
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7227461)
