Pages that link to "Item:Q2140213"

The following pages link to The pickup and delivery problem with time windows, multiple stacks, and handling operations (Q2140213):

Displaying 12 items.

• Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks (Q322560) (← links)
• The pickup and delivery problem with time windows and handling operations (Q1652028) (← links)
• The multi-pickup and delivery problem with time windows (Q1744529) (← links)
• The pickup and delivery traveling salesman problem with handling costs (Q1752776) (← links)
• Synchronized pickup and delivery problems with connecting FIFO stack (Q2056913) (← links)
• Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries (Q3652242) (← links)
• Pickup and Delivery of Partial Loads with “Soft” Time Windows (Q3771948) (← links)
• The Pickup And Delivery Problem With Time Windows And Transshipment (Q6043232) (← links)
• Waiting and Buffering Strategies for the Dynamic Pickup and Delivery Problem with Time Windows (Q6160362) (← links)
• Robust optimization for the electric vehicle pickup and delivery problem with time windows and uncertain demands (Q6164316) (← links)
• A metaheuristic algorithm for a locomotive routing problem arising in the steel industry (Q6167423) (← links)
• Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff (Q6667800) (← links)