Pages that link to "Item:Q1915968"
From MaRDI portal
The following pages link to The traveling salesman problem with backhauls (Q1915968):
Displayed 19 items.
- An exact algorithm for the clustered travelling salesman problem (Q505157) (← links)
- The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm (Q847836) (← links)
- Self-organizing feature maps for the vehicle routing problem with backhauls (Q880535) (← links)
- Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search (Q926338) (← links)
- Model and algorithm for inventory/routing decision in a three-echelon logistics system (Q932178) (← links)
- Variable neighborhood search (Q1374041) (← links)
- A heuristic for the pickup and delivery traveling salesman problem (Q1571039) (← links)
- Perturbation heuristics for the pickup and delivery traveling salesman problem (Q1603311) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q2359136) (← links)
- Vehicle routing problems with simultaneous pick-up and delivery service. (Q2467847) (← links)
- Heuristic approaches to vehicle routing with backhauls and time windows (Q2564754) (← 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)
- A Heuristic Approach for Cluster TSP (Q3297279) (← links)
- One-to-Many-to-One Single Vehicle Pickup and Delivery Problems (Q3564364) (← links)
- Variable neighborhood search: Principles and applications (Q5937708) (← links)
- An approximation algorithm for the clustered path travelling salesman problem (Q6039533) (← links)
- An approximation algorithm for the clustered path travelling salesman problem (Q6167001) (← links)