A minimum cost network flow model for the maximum covering and patrol routing problem
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.
routing multi-commodity problem structuring minimum cost network flow problem