A minimum cost network flow model for the maximum covering and patrol routing problem
Lists
Only you see this
Abstract
Highlights•Maximum Covering and Patrol Routing Problem modeled as a MCNFP.•Benchmark instances solved two orders of magnitude faster than existing heuristics.•Proof that the MCPRP is not NP-hard.•Practical extensions can be modeled by a Multi-Commodity MCNFP.
BibTeX
@article{dewil2015minimum,
author = {Reginald Dewil and Pieter Vansteenwegen and Dirk Cattrysse and Dirk Van Oudheusden},
title = {{A minimum cost network flow model for the maximum covering and patrol routing problem}},
journal = {Eur. J. Oper. Res.},
year = {2015},
doi = {10.1016/j.ejor.2015.05.067},
}Loading related content...