Pages that link to "Item:Q1071656"

The following pages link to An algorithm for the traveling salesman problem with pickup and delivery customers (Q1071656):

Displaying 28 items.

• A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases (Q420868) (← links)
• The tree representation for the pickup and delivery traveling salesman problem with LIFO loading (Q421561) (← links)
• An exact algorithm for the clustered travelling salesman problem (Q505157) (← links)
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm (Q847836) (← links)
• Self-organizing feature maps for the vehicle routing problem with backhauls (Q880535) (← links)
• The pickup and delivery traveling salesman problem with first-in-first-out loading (Q1000960) (← links)
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches (Q1027598) (← 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 heuristic for the pickup and delivery traveling salesman problem (Q1571039) (← links)
• Perturbation heuristics for the pickup and delivery traveling salesman problem (Q1603311) (← links)
• Exact solutions for the collaborative pickup and delivery problem (Q1787916) (← links)
• The traveling salesman problem with backhauls (Q1915968) (← links)
• Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints (Q1926986) (← links)
• A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q2359136) (← links)
• Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints (Q2455613) (← links)
• A new VRPPD model and a hybrid heuristic solution approach for e-tailing (Q2514740) (← links)
• Heuristic approaches to vehicle routing with backhauls and time windows (Q2564754) (← links)
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
• Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem (Q2907956) (← links)
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading (Q3057131) (← 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)
• Better assignment lower bounds for the Euclidean traveling salesman problem (Q3771999) (← links)
• AN ALGORITHM FOR THE GENERALIZED VEHICLE ROUTING PROBLEM WITH BACKHAULING (Q5315981) (← links)
• Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding (Q5865336) (← links)
• Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems (Q6090149) (← links)
• An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading (Q6160334) (← links)