A Patrol Car Allocation Model: Capabilities and Algorithms
From MaRDI portal
Publication:4168772
DOI10.1287/mnsc.24.12.1291zbMath0386.90036OpenAlexW2104321173MaRDI QIDQ4168772
Publication date: 1978
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.24.12.1291
Applications of mathematical programming (90C90) Sensitivity, stability, parametric optimization (90C31) Queues and service in operations research (90B22) Operations research and management science (90B99)
Related Items (9)
Determining optimal police patrol areas with maximal covering and backup covering location models ⋮ Technical Note—Optimal Patrol of a Perimeter ⋮ A multi-criteria police districting problem for the efficient and effective design of patrol sector ⋮ A queueing-location model with expected service time dependent queueing disciplines ⋮ Nonlinear goal programming model for the development of metropolitan police patrol units ⋮ Location-allocation models for traffic police patrol vehicles on an interurban network ⋮ A 0-1 nonlinear programming model for coast guard fisheries law enforcement aircraft patrols ⋮ A simulated annealing approach to police district design ⋮ Heuristic methods and applications: A categorized survey
This page was built for publication: A Patrol Car Allocation Model: Capabilities and Algorithms
