Pages that link to "Item:Q1652266"
From MaRDI portal
The following pages link to Multi-vehicle prize collecting arc routing for connectivity problem (Q1652266):
Displaying 16 items.
- A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration (Q1711440) (← links)
- Minimizing latency in post-disaster road clearance operations (Q1740563) (← links)
- Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity (Q1752846) (← links)
- Synchronizing victim evacuation and debris removal: a data-driven robust prediction approach (Q2116883) (← links)
- A greedy randomized adaptive search procedure (GRASP) for the multi-vehicle prize collecting arc routing for connectivity problem (Q2147067) (← links)
- Modeling emergency response operations: a theory building survey (Q2177817) (← links)
- Decomposition-based algorithms for the crew scheduling and routing problem in road restoration (Q2177830) (← links)
- A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings (Q2178909) (← links)
- Robust post-disaster route restoration (Q2215565) (← links)
- Weighted online minimum latency problem with edge uncertainty (Q2239843) (← links)
- A scatter search algorithm for time-dependent prize-collecting arc routing problems (Q2669496) (← links)
- An online optimization approach for post-disaster relief distribution with online blocked edges (Q2669638) (← links)
- Routing multiple work teams to minimize latency in post-disaster road network restoration (Q2670582) (← links)
- The Post-Disaster Debris Clearance Problem Under Incomplete Information (Q3195231) (← links)
- Integrated reinforcement and repair of interdependent infrastructure networks under disaster-related uncertainties (Q6167421) (← links)
- An updated annotated bibliography on arc routing problems (Q6496350) (← links)
