Pages that link to "Item:Q5295487"

The following pages link to Competitive analysis for dynamic multiperiod uncapacitated routing problems (Q5295487):

Displaying 19 items.

• The dynamic multiperiod vehicle routing problem with probabilistic information (Q337038) (← links)
• A branch-and-price approach for a multi-period vehicle routing problem (Q337422) (← links)
• A multi-shift vehicle routing problem with windows and cycle times (Q360503) (← links)
• Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework (Q363544) (← links)
• Essential particle swarm optimization queen with tabu search for MKP resolution (Q488403) (← links)
• Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs (Q621695) (← links)
• The dynamic dispatch waves problem for same-day delivery (Q724132) (← links)
• Clever or smart: strategies for the online target date assignment problem (Q968114) (← links)
• Algorithms for on-line order batching in an order picking warehouse (Q1761193) (← links)
• The dynamic multi-period vehicle routing problem (Q2270447) (← links)
• Competitive analysis of a dispatch policy for a dynamic multi-period routing problem (Q2467440) (← links)
• A dynamic multi-period general routing problem arising in postal service and parcel delivery systems (Q2668612) (← links)
• Online traveling salesman problems with service flexibility (Q3100693) (← links)
• The Post-Disaster Debris Clearance Problem Under Incomplete Information (Q3195231) (← links)
• Recent Developments in Dynamic Vehicle Routing Systems (Q3564357) (← links)
• Online Vehicle Routing Problems: A Survey (Q3564358) (← links)
• Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty (Q4994141) (← links)
• Management Policies in a Dynamic Multi Period Routing Problem (Q5850922) (← links)
• Dynamic multi-period vehicle routing with touting (Q6113318) (← links)