Pages that link to "Item:Q421561"
From MaRDI portal
The following pages link to The tree representation for the pickup and delivery traveling salesman problem with LIFO loading (Q421561):
Displaying 10 items.
- A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading (Q337617) (← 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)
- The pickup and delivery traveling salesman problem with handling costs (Q1752776) (← 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)
- Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q2670579) (← 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 metaheuristic algorithm for a locomotive routing problem arising in the steel industry (Q6167423) (← links)
