Multi-vehicle prize collecting arc routing for connectivity problem
DOI10.1016/j.cor.2017.01.007zbMath1391.90499OpenAlexW2574071994WikidataQ56476033 ScholiaQ56476033MaRDI QIDQ1652266
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://nottingham-repository.worktribe.com/output/1141316
mixed integer programmingarc routingmatheuristicnetwork connectivitydisaster responseprize collectingroad clearance
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (12)
Cites Work
- The synchronized arc and node routing problem: application to road marking
- A hierarchical compromise model for the joint optimization of recovery operations and distribution of emergency goods in Humanitarian logistics
- Heuristics for the time dependent team orienteering problem: application to tourist route planning
- The time-dependent prize-collecting arc routing problem
- A GRASP metaheuristic to improve accessibility after a disaster
- Optimal scheduling of emergency roadway repair and subsequent relief distribution
- Solving the prize-collecting rural postman problem
- Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity
- Synchronized arc routing for snow plowing operations
- Profitable mixed capacitated arc routing and related problems
- Privatized rural postman problems
- The Post-Disaster Debris Clearance Problem Under Incomplete Information
- The prize collecting traveling salesman problem
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Arc Routing Problems, Part II: The Rural Postman Problem
This page was built for publication: Multi-vehicle prize collecting arc routing for connectivity problem