Pages that link to "Item:Q1000960"

The following pages link to The pickup and delivery traveling salesman problem with first-in-first-out loading (Q1000960):

Displaying 14 items.

• A hybrid approach for the vehicle routing problem with three-dimensional loading constraints (Q336326) (← links)
• Routing problems with loading constraints (Q610992) (← links)
• Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading (Q1046716) (← 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)
• 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)
• A multicommodity pickup and delivery problem with time windows and handling time in the omni-channel last-mile delivery (Q6659827) (← links)