Pages that link to "Item:Q3064039"
From MaRDI portal
The following pages link to Exact solutions to the double travelling salesman problem with multiple stacks (Q3064039):
Displayed 24 items.
- Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks (Q322560) (← links)
- A hybrid approach for the vehicle routing problem with three-dimensional loading constraints (Q336326) (← links)
- The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach (Q336445) (← links)
- Exact algorithms for the double vehicle routing problem with multiple stacks (Q342039) (← links)
- Comments on: Routing problems with loading constraints (Q610993) (← links)
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316) (← links)
- An adapted heuristic approach for a clustered traveling salesman problem with loading constraints (Q693154) (← 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)
- 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)
- Vehicle routing problems with loading constraints: state-of-the-art and future directions (Q2018104) (← links)
- Approximation of the double traveling salesman problem with multiple stacks (Q2034797) (← links)
- The pickup and delivery problem with time windows, multiple stacks, and handling operations (Q2140213) (← links)
- Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints (Q2275601) (← links)
- Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q2670579) (← links)
- A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks (Q2835682) (← links)
- New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q2968488) (← links)
- A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks (Q5246822) (← 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)
- 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)