An exact method for the double TSP with multiple stacks
From MaRDI portal
Recommendations
- Improved exact method for the double TSP with multiple stacks
- Exact solutions to the double travelling salesman problem with multiple stacks
- Exact algorithms for the double vehicle routing problem with multiple stacks
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks
Cites work
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
- 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
- Stability aspects of the traveling salesman problem based on \(k\)-best solutions
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- The symmetric clustered traveling salesman problem
Cited in
(29)- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks
- Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks
- Efficient algorithms for the double traveling salesman problem with multiple stacks
- Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- Approximation of the double traveling salesman problem with multiple stacks
- The pickup and delivery problem with time windows, multiple stacks, and handling operations
- Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints
- Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
- A set covering approach for the double traveling salesman problem with multiple stacks
- New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
- Exact solutions to the double travelling salesman problem with multiple stacks
- Improved exact method for the double TSP with multiple stacks
- Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
- A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
- The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach
- Exact algorithms for the double vehicle routing problem with multiple stacks
- On the Complexity of the Multiple Stack TSP, kSTSP
- A method for optimizing the collection of pallets using the traveling salesman problem
- A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
- A branch-and-bound algorithm for the double travelling salesman problem with two stacks
- The double traveling salesman problem with partial last‐in‐first‐out loading constraints
- A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints
- A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks
- Routing problems with loading constraints
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
- An adapted heuristic approach for a clustered traveling salesman problem with loading constraints
This page was built for publication: An exact method for the double TSP with multiple stacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3002549)
