Pages that link to "Item:Q4700651"

The following pages link to Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries (Q4700651):

Displaying 19 items.

• A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem (Q322620) (← links)
• Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery (Q850302) (← links)
• A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem (Q959510) (← links)
• On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands (Q1013973) (← links)
• Perturbation heuristics for the pickup and delivery traveling salesman problem (Q1603311) (← links)
• A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping (Q1652016) (← links)
• Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q1652698) (← links)
• An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation (Q1695028) (← links)
• Polynomially solvable cases of the bipartite traveling salesman problem (Q1752819) (← links)
• Solving the shortest route cut and fill problem using simulated annealing (Q1869428) (← links)
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem (Q1926735) (← links)
• A truck scheduling problem arising in intermodal container transportation (Q2356036) (← links)
• An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot (Q2357926) (← links)
• Mathematical formulations for a 1-full-truckload pickup-and-delivery problem (Q2630253) (← links)
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
• The multi-commodity pickup-and-delivery traveling salesman problem (Q2811323) (← links)
• Balancing the stations of a self service “bike hire” system (Q3016180) (← links)
• Approximation results for min-max path cover problems in vehicle routing (Q3065634) (← links)
• A branch‐and‐cut algorithm for the nonpreemptive swapping problem (Q5187945) (← links)