Pages that link to "Item:Q322560"

The following pages link to Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks (Q322560):

Displaying 9 items.

• Daily aircraft routing for amphibious ready groups (Q1639311) (← links)
• The pickup and delivery problem with time windows and handling operations (Q1652028) (← links)
• Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks (Q1652571) (← links)
• Dynamic courier routing for a food delivery service (Q1738833) (← links)
• Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems (Q1754114) (← links)
• Exact solutions for the collaborative pickup and delivery problem (Q1787916) (← links)
• Vehicle routing problems with loading constraints: state-of-the-art and future directions (Q2018104) (← links)
• The pickup and delivery problem with time windows, multiple stacks, and handling operations (Q2140213) (← links)
• A metaheuristic algorithm for a locomotive routing problem arising in the steel industry (Q6167423) (← links)