Pages that link to "Item:Q1025245"
From MaRDI portal
The following pages link to The double traveling salesman problem with multiple stacks: A variable neighborhood search approach (Q1025245):
Displayed 26 items.
- The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach (Q336445) (← links)
- Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems (Q339582) (← links)
- Exact algorithms for the double vehicle routing problem with multiple stacks (Q342039) (← links)
- The tree representation for the pickup and delivery traveling salesman problem with LIFO loading (Q421561) (← 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)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review (Q1730669) (← links)
- The traveling salesman problem with draft limits (Q1761142) (← links)
- Efficient algorithms for the double traveling salesman problem with multiple stacks (Q1762078) (← links)
- Variable neighbourhood structures for cycle location problems (Q1926979) (← 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)
- 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)
- Improved exact method for the double TSP with multiple stacks (Q3113513) (← links)
- Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks (Q4648688) (← 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)