Pages that link to "Item:Q1000960"
From MaRDI portal
The following pages link to The pickup and delivery traveling salesman problem with first-in-first-out loading (Q1000960):
Displaying 21 items.
- A hybrid approach for the vehicle routing problem with three-dimensional loading constraints (Q336326) (← links)
- The tree representation for the pickup and delivery traveling salesman problem with LIFO loading (Q421561) (← links)
- Routing problems with loading constraints (Q610992) (← links)
- The unit capacity pickup and delivery problem on a one-way loop (Q800829) (← links)
- Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search (Q926338) (← links)
- Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading (Q1046716) (← links)
- A heuristic for the pickup and delivery traveling salesman problem (Q1571039) (← links)
- Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks (Q1652571) (← links)
- Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading (Q1652699) (← links)
- Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system (Q1751731) (← links)
- The pickup and delivery traveling salesman problem with handling costs (Q1752776) (← 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)
- Vehicle routing problems with loading constraints: state-of-the-art and future directions (Q2018104) (← links)
- Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading (Q2892373) (← links)
- The traveling salesman problem with pickup, delivery, and ride-time constraints (Q4642421) (← 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 multicommodity pickup and delivery problem with time windows and handling time in the omni-channel last-mile delivery (Q6659827) (← links)