Pages that link to "Item:Q3057131"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading (Q3057131):
Displayed 20 items.
- The tree representation for the pickup and delivery traveling salesman problem with LIFO loading (Q421561) (← links)
- Routing problems with loading constraints (Q610992) (← links)
- Heuristic and exact algorithms for the multi-pile vehicle routing problem (Q657060) (← links)
- An adapted heuristic approach for a clustered traveling salesman problem with loading constraints (Q693154) (← links)
- New neighborhood structures for the double traveling salesman problem with multiple stacks (Q839902) (← links)
- The double traveling salesman problem with multiple stacks: A variable neighborhood search approach (Q1025245) (← links)
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches (Q1027598) (← links)
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints (Q1038331) (← links)
- Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading (Q1046716) (← links)
- The traveling salesman problem with draft limits (Q1761142) (← links)
- Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs (Q1762084) (← links)
- Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints (Q1926986) (← links)
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
- Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem (Q2907956) (← links)
- An exact method for the double TSP with multiple stacks (Q3002549) (← links)
- Exact solutions to the double travelling salesman problem with multiple stacks (Q3064039) (← links)
- Improved exact method for the double TSP with multiple stacks (Q3113513) (← links)
- Recent Models and Algorithms for One-to-One Pickup and Delivery Problems (Q3564363) (← 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)