A minimum cost network flow model for the maximum covering and patrol routing problem

DOI10.1016/J.EJOR.2015.05.067zbMath1346.90213OpenAlexW1945132021MaRDI QIDQ319918

Pieter Vansteenwegen, Reginald Dewil, Dirk D. L. van Oudheusden, Dirk G. Cattrysse

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/469354

zbMATH Keywords

routingmulti-commodityproblem structuringminimum cost network flow problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (5)

Time dependent orienteering problem with time windows and service time dependent profits ⋮ On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage ⋮ On the computational complexity of the patrol boat scheduling problem with complete coverage ⋮ Attractive orienteering problem with proximity and timing interactions ⋮ Optimizing insertions in a constraint routing problem with complicated cost functions

Cites Work

• An improved formulation for the maximum coverage patrol routing problem
• Adaptive memory in multistart heuristics for multicommodity network design
• The orienteering problem: a survey
• A polynomial time primal network simplex algorithm for minimum cost flows
• A memetic algorithm for the orienteering problem with hotel selection
• On the Complexity of Timetable and Multicommodity Flow Problems
• Arc Routing Problems, Part II: The Rural Postman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A minimum cost network flow model for the maximum covering and patrol routing problem