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

DOI10.1016/J.EJOR.2015.05.067MaRDI QIDQ319918zbMATH OpenOpenAlexFDO

Authors Pieter Vansteenwegen, R. Dewil, Dirk Cattrysse, D. Van Oudheusden

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)

Recommendations

• An improved formulation for the maximum coverage patrol routing problem
• The minimum cover flow problem in networks
• The maximum covering/shortest path problem: A multiobjective network design and routing formulation
• The problem of minimum cost flow in undirected networks: optimality conditions and analysis of alternative formulations
• scientific article; zbMATH DE number 1918689
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• Minimum-cost flows in unit-capacity networks
• An \(O(nm^ 2)\) time algorithm for solving minimal cost network flow problems
• The problem of maximum flow with minimum attainable cost in a network
• Minimum cost noncrossing flow problem on layered networks

Cites work

• scientific article; zbMATH DE number 6382860 (Why is no real title available?)
• scientific article; zbMATH DE number 194738 (Why is no real title available?)
• scientific article; zbMATH DE number 910907 (Why is no real title available?)
• A memetic algorithm for the orienteering problem with hotel selection
• A polynomial time primal network simplex algorithm for minimum cost flows
• Adaptive memory in multistart heuristics for multicommodity network design
• An improved formulation for the maximum coverage patrol routing problem
• Arc Routing Problems, Part II: The Rural Postman Problem
• On the Complexity of Timetable and Multicommodity Flow Problems
• The orienteering problem: a survey

Cited in

(10)

• Maximum flow-covering location and service start time problem and its application to Tokyo metropolitan railway network
• On the computational complexity of the patrol boat scheduling problem with complete coverage
• Optimizing insertions in a constraint routing problem with complicated cost functions
• 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
• Selection of circulatory loops for patrol vehicles operating in a network
• An improved formulation for the maximum coverage patrol routing problem
• Attractive orienteering problem with proximity and timing interactions
• The Hot Spot Coverage Patrol Problem: Formulations and Solution Approaches
• Computational complexity of the police officer patrol problem on weighted digraphs

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

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