Pages that link to "Item:Q3630221"
From MaRDI portal
The following pages link to On the Complexity of the Multiple Stack TSP, kSTSP (Q3630221):
Displaying 10 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)
- Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks (Q1751162) (← links)
- Efficient algorithms for the double traveling salesman problem with multiple stacks (Q1762078) (← links)
- Approximation of the double traveling salesman problem with multiple stacks (Q2034797) (← links)
- Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints (Q2275601) (← links)
- A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks (Q2835682) (← links)
- (Q2861493) (← links)
- A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q5326770) (← links)
- A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks (Q5326779) (← links)
