The following pages link to (Q4414640):
Displaying 14 items.
- Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery (Q705506) (← links)
- The unit capacity pickup and delivery problem on a one-way loop (Q800829) (← links)
- On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands (Q1013973) (← links)
- A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem (Q1628071) (← links)
- Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q1652698) (← links)
- An exact algorithm for the Split-Demand One-Commodity Pickup-And-Delivery Travelling Salesman problem (Q1661892) (← links)
- Inventory rebalancing and vehicle routing in bike sharing systems (Q1752898) (← links)
- The single-vehicle two-echelon one-commodity pickup and delivery problem (Q2027019) (← links)
- An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot (Q2357926) (← links)
- Bike sharing systems: solving the static rebalancing problem (Q2445841) (← links)
- Projection results for vehicle routing (Q2583125) (← links)
- Balancing the stations of a self service “bike hire” system (Q3016180) (← links)
- The traveling salesman problem with pickup, delivery, and ride-time constraints (Q4642421) (← links)
