Pages that link to "Item:Q320880"
From MaRDI portal
The following pages link to Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem (Q320880):
Displaying 12 items.
- The constrained shortest path problem with stochastic correlated link travel times (Q323479) (← links)
- A branch-and-price algorithm for the minimum latency problem (Q1652580) (← links)
- A truck and drones model for last-mile delivery: a mathematical model and heuristic approach (Q1988950) (← links)
- The multi-depot \(k\)-traveling repairman problem (Q2091220) (← links)
- Solving the humanitarian multi-trip cumulative capacitated routing problem via a grouping metaheuristic algorithm (Q2108783) (← links)
- New formulations and solution approaches for the latency location routing problem (Q2147033) (← 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)
- An adaptive large neighborhood search approach for multiple traveling repairman problem with profits (Q2273692) (← 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)
- Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND (Q6070871) (← links)
