An improved formulation for the maximum coverage patrol routing problem

DOI10.1016/J.COR.2014.12.002MaRDI QIDQ337517zbMATH OpenOpenAlexFDO

Authors Ịbrahim Çapar, Burcu B. Keskin, Paul A. Rubin

Publication date 10 November 2016

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

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

zbMATH Keywords

resource allocationroutingmixed integer linear program

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Recommendations

• A minimum cost network flow model for the maximum covering and patrol routing problem
• Mixed-integer programming approaches for the time-constrained maximal covering routing problem
• Location-coverage models for preventing attacks on interurban transportation networks
• Determining optimal police patrol areas with maximal covering and backup covering location models
• The multi-vehicle probabilistic covering tour problem

Cites work

• Formulations and Reformulations in Integer Programming
• Perspective reformulation and applications
• The orienteering problem: a survey

Cited in

(8)

• Attractive orienteering problem with proximity and timing interactions
• On the computational complexity of the patrol boat scheduling problem with complete coverage
• A minimum cost network flow model for the maximum covering and patrol routing problem
• Determining optimal police patrol areas with maximal covering and backup covering location models
• On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage
• Location-coverage models for preventing attacks on interurban transportation networks
• Safe and secure vehicle routing: a survey on minimization of risk exposure
• The Hot Spot Coverage Patrol Problem: Formulations and Solution Approaches

This page was built for publication: An improved formulation for the maximum coverage patrol routing problem

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