Pages that link to "Item:Q1342089"
From MaRDI portal
The following pages link to The traveling salesman problem with delivery and backhauls (Q1342089):
Displayed 16 items.
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery (Q705506) (← links)
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries (Q707138) (← links)
- A heuristic method for the vehicle routing problem with mixed deliveries and pickups (Q835589) (← links)
- Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery (Q850302) (← links)
- CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up (Q859684) (← links)
- An approximation algorithm for the pickup and delivery vehicle routing problem on trees (Q860395) (← links)
- A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries (Q927194) (← links)
- An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot (Q2357926) (← links)
- Vehicle routing problems with simultaneous pick-up and delivery service. (Q2467847) (← links)
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service (Q2566927) (← links)
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
- The multi-commodity pickup-and-delivery traveling salesman problem (Q2811323) (← links)
- One-to-Many-to-One Single Vehicle Pickup and Delivery Problems (Q3564364) (← links)
- Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries (Q4700651) (← links)
- Unified heuristics to solve routing problem of reverse logistics in sustainable supply chain (Q5494706) (← links)
- The vehicle routing problem with pickups and deliveries on some special graphs (Q5957355) (← links)