Pages that link to "Item:Q5326770"
From MaRDI portal
The following pages link to A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q5326770):
Displaying 12 items.
- Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks (Q322560) (← links)
- Exact algorithms for the double vehicle routing problem with multiple stacks (Q342039) (← links)
- Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks (Q1652571) (← links)
- 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)
- Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q2670579) (← links)
- New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q2968488) (← links)
- A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs (Q6064162) (← links)
- The double traveling salesman problem with partial last‐in‐first‐out loading constraints (Q6071059) (← links)
- A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints (Q6080619) (← links)
- A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks (Q6088235) (← links)
