Pages that link to "Item:Q2861493"
From MaRDI portal
The following pages link to Approximability of the multiple stack TSP (Q2861493):
Displaying 6 items.
- The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach (Q336445) (← links)
- Exact algorithms for the double vehicle routing problem with multiple stacks (Q342039) (← links)
- An approximation algorithm for the stack-up problem (Q1574533) (← links)
- Approximation of the double traveling salesman problem with multiple stacks (Q2034797) (← links)
- A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots (Q2802244) (← links)
- Approximating TSP Solution by MST Based Graph Pyramid (Q5325746) (← links)