Pages that link to "Item:Q2034797"
From MaRDI portal
The following pages link to Approximation of the double traveling salesman problem with multiple stacks (Q2034797):
Displaying 9 items.
- Exact algorithms for the double vehicle routing problem with multiple stacks (Q342039) (← links)
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316) (← links)
- The double traveling salesman problem with multiple stacks: A variable neighborhood search approach (Q1025245) (← links)
- In memory of Jérôme Monnot (Q2140557) (← links)
- An LP-based approximation algorithm for the generalized traveling salesman path problem (Q2680860) (← links)
- Approximability of the multiple stack TSP (Q2861493) (← links)
- The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks (Q3167617) (← links)
- The double traveling salesman problem with partial last‐in‐first‐out loading constraints (Q6071059) (← links)
- A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints (Q6080619) (← links)