Pages that link to "Item:Q2514732"
From MaRDI portal
The following pages link to A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2514732):
Displaying 20 items.
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs (Q297063) (← links)
- Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem (Q320880) (← links)
- The latency location-routing problem (Q323569) (← links)
- Minimizing latency of capacitated \(k\)-tours (Q724250) (← links)
- A branch-and-price algorithm for the minimum latency problem (Q1652580) (← links)
- The multi-vehicle cumulative covering tour problem (Q1686527) (← links)
- The multi-depot \(k\)-traveling repairman problem (Q2091220) (← links)
- A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning (Q2116920) (← links)
- New formulations and solution approaches for the latency location routing problem (Q2147033) (← links)
- An effective hybrid search algorithm for the multiple traveling repairman problem with profits (Q2171586) (← links)
- A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem (Q2174909) (← links)
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network (Q2197321) (← links)
- A heuristic for cumulative vehicle routing using column generation (Q2357169) (← links)
- A hybrid ant colony optimization-variable neighborhood descent approach for the cumulative capacitated vehicle routing problem (Q2669499) (← links)
- Routing multiple work teams to minimize latency in post-disaster road network restoration (Q2670582) (← links)
- A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2688881) (← links)
- Integrated Production Scheduling and Delivery Routing: Complexity Results and Column Generation (Q2835699) (← links)
- Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND (Q6070871) (← links)
- The cumulative school bus routing problem: Polynomial‐size formulations (Q6180039) (← links)
- An adaptive large neighborhood search for the multi-point dynamic aggregation problem (Q6636938) (← links)