Pages that link to "Item:Q5434593"
From MaRDI portal
The following pages link to The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms (Q5434593):
Displaying 28 items.
- The static bicycle relocation problem with demand intervals (Q296779) (← links)
- An exact algorithm for the static rebalancing problem arising in bicycle sharing systems (Q319656) (← links)
- A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem (Q322620) (← links)
- Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
- A destroy and repair algorithm for the bike sharing rebalancing problem (Q342356) (← links)
- A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem (Q602676) (← 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)
- The double traveling salesman problem with multiple stacks: A variable neighborhood search approach (Q1025245) (← links)
- A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem (Q1628071) (← links)
- Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer (Q1634057) (← 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)
- An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation (Q1695028) (← links)
- Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem (Q1751783) (← links)
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem (Q1926735) (← links)
- The single-vehicle two-echelon one-commodity pickup and delivery problem (Q2027019) (← links)
- A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q2242245) (← 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)
- A new VRPPD model and a hybrid heuristic solution approach for e-tailing (Q2514740) (← links)
- The multi-commodity pickup-and-delivery traveling salesman problem (Q2811323) (← links)
- A branch-and-cut algorithm for the preemptive swapping problem (Q2913951) (← links)
- Recent Models and Algorithms for One-to-One Pickup and Delivery Problems (Q3564363) (← links)
- A branch‐and‐cut algorithm for the nonpreemptive swapping problem (Q5187945) (← links)
- Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route (Q5326796) (← links)
- A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem (Q6065616) (← links)
- Vehicle routing problems with multiple commodities: a survey (Q6572828) (← links)
