Pages that link to "Item:Q4363764"
From MaRDI portal
The following pages link to An Approximation Algorithm for the Traveling Salesman Problem with Backhauls (Q4363764):
Displaying 14 items.
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743) (← links)
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries (Q707138) (← links)
- CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up (Q859684) (← links)
- Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns (Q1014953) (← links)
- A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems (Q1306365) (← links)
- Perturbation heuristics for the pickup and delivery traveling salesman problem (Q1603311) (← links)
- On residual approximation in solution extension problems (Q1631675) (← links)
- The traveling salesman problem with backhauls (Q1915968) (← links)
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem (Q1926735) (← links)
- A Lagrangian relaxation-based heuristic for the vehicle routing with full container load (Q2432884) (← links)
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
- Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems (Q2676463) (← links)
- On Residual Approximation in Solution Extension Problems (Q2958338) (← links)
- One-to-Many-to-One Single Vehicle Pickup and Delivery Problems (Q3564364) (← links)
