Pages that link to "Item:Q2784475"
From MaRDI portal
The following pages link to Algorithms for capacitated vehicle routing (Q2784475):
Displaying 15 items.
- Semi-preemptive routing on a linear and circular track (Q834179) (← links)
- Approximation algorithms for the load-balanced capacitated vehicle routing problem (Q2043586) (← links)
- Optimal online and offline algorithms for robot-assisted restoration of barrier coverage (Q2197483) (← links)
- Online and offline algorithms for the sorting buffers problem on the line metric (Q2266935) (← links)
- The pyramidal capacitated vehicle routing problem (Q2270294) (← links)
- An approximation algorithm for vehicle routing with compatibility constraints (Q2294242) (← links)
- Capacitated vehicle routing with nonuniform speeds (Q2800377) (← links)
- Vehicle Routing Algorithms for Radially Escaping Targets (Q2949981) (← links)
- Balancing the stations of a self service “bike hire” system (Q3016180) (← links)
- Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand (Q3105744) (← links)
- Nonpreemptive Ensemble Motion Planning on a Tree (Q3141520) (← links)
- Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier Coverage (Q3453288) (← links)
- Minimum Makespan Multi-vehicle Dial-a-Ride (Q3639273) (← links)
- Approximating Capacitated Routing and Delivery Problems (Q4268861) (← links)
- Bike rebalancing: how to find a balanced matching in the k center problem? (Q6565428) (← links)