Pages that link to "Item:Q3113513"
From MaRDI portal
The following pages link to Improved exact method for the double TSP with multiple stacks (Q3113513):
Displayed 6 items.
- Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks (Q1751162) (← links)
- Vehicle routing problems with loading constraints: state-of-the-art and future directions (Q2018104) (← links)
- The pickup and delivery problem with time windows, multiple stacks, and handling operations (Q2140213) (← links)
- A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks (Q2835682) (← links)
- A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks (Q5246822) (← links)
- A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints (Q6080619) (← links)