An improved formulation for the maximum coverage patrol routing problem

DOI10.1016/j.cor.2014.12.002zbMath1348.90073OpenAlexW2064555825MaRDI QIDQ337517

Burcu B. Keskin, Ịbrahim Çapar, 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)

Related Items

A minimum cost network flow model for the maximum covering and patrol routing problem ⋮ 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 ⋮ On the computational complexity of the patrol boat scheduling problem with complete coverage ⋮ Attractive orienteering problem with proximity and timing interactions

Cites Work

• The orienteering problem: a survey
• Perspective Reformulation and Applications
• Formulations and Reformulations in Integer Programming

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