A minimum cost network flow model for the maximum covering and patrol routing problem
From MaRDI portal
Publication:319918
DOI10.1016/J.EJOR.2015.05.067zbMATH Open1346.90213OpenAlexW1945132021MaRDI QIDQ319918FDOQ319918
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
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
- The orienteering problem: a survey
- A polynomial time primal network simplex algorithm for minimum cost flows
- On the Complexity of Timetable and Multicommodity Flow Problems
- Arc Routing Problems, Part II: The Rural Postman Problem
- A memetic algorithm for the orienteering problem with hotel selection
- Title not available (Why is that?)
- An improved formulation for the maximum coverage patrol routing problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Adaptive memory in multistart heuristics for multicommodity network design
Cited In (8)
- Time dependent orienteering problem with time windows and service time dependent profits
- 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
- Attractive orienteering problem with proximity and timing interactions
- An improved formulation for the maximum coverage patrol routing problem
- On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage
- Optimizing insertions in a constraint routing problem with complicated cost functions
- Selection of circulatory loops for patrol vehicles operating in a network
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)
