Pages that link to "Item:Q1046716"

The following pages link to Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading (Q1046716):

Displaying 16 items.

• TSP race: minimizing completion time in time-sensitive applications (Q319282) (← 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)
• Routing problems with loading constraints (Q610992) (← links)
• The pickup and delivery traveling salesman problem with first-in-first-out loading (Q1000960) (← links)
• The pickup and delivery problem: Faces and branch-and-cut algorithm (Q1368475) (← 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)
• Efficient algorithms for the double traveling salesman problem with multiple stacks (Q1762078) (← links)
• Vehicle routing problems with loading constraints: state-of-the-art and future directions (Q2018104) (← links)
• New Imperialist Competitive Algorithm to solve the travelling salesman problem (Q2855772) (← links)
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading (Q3057131) (← 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 branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs (Q6064162) (← links)