Pages that link to "Item:Q1603311"

The following pages link to Perturbation heuristics for the pickup and delivery traveling salesman problem (Q1603311):

Displaying 18 items.

• Models for the single-vehicle preemptive pickup and delivery problem (Q421257) (← links)
• The tree representation for the pickup and delivery traveling salesman problem with LIFO loading (Q421561) (← links)
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm (Q847836) (← links)
• The pickup and delivery traveling salesman problem with first-in-first-out loading (Q1000960) (← links)
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q1041945) (← links)
• Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading (Q1046716) (← links)
• A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping (Q1652016) (← links)
• The pickup and delivery traveling salesman problem with handling costs (Q1752776) (← links)
• Heuristics for the traveling purchaser problem (Q1870801) (← links)
• Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints (Q1926986) (← links)
• A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem (Q2433528) (← links)
• Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem (Q2676332) (← links)
• Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem (Q2907956) (← links)
• Recent Models and Algorithms for One-to-One Pickup and Delivery Problems (Q3564363) (← links)
• EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM (Q3580197) (← links)
• Models and algorithms for the dynamic-demand joint replenishment problem (Q4671273) (← links)
• An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading (Q6160334) (← links)
• Planification des tournées dans le domaine de la messagerie rapide (Q6160412) (← links)