Improved exact method for the double TSP with multiple stacks
From MaRDI portal
Publication:3113513
DOI10.1002/net.20473zbMath1231.90097MaRDI QIDQ3113513
No author found.
Publication date: 18 January 2012
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20473
Related Items
A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks, A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints, Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks, Vehicle routing problems with loading constraints: state-of-the-art and future directions, The pickup and delivery problem with time windows, multiple stacks, and handling operations, A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks
Uses Software
Cites Work
- New neighborhood structures for the double traveling salesman problem with multiple stacks
- The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- An exact method for the double TSP with multiple stacks
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem