Pages that link to "Item:Q593987"

The following pages link to A Lagrangean relaxation heuristic for vehicle routing (Q593987):

Displaying 8 items.

• A comparison of techniques for solving the fleet size and mix vehicle routing problem (Q800225) (← links)
• A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems (Q1122488) (← links)
• A TSSP+1 decomposition strategy for the vehicle routing problem (Q1342652) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• A parallel implementation of the TSSP+1 decomposition for the capacity-constrained vehicle routing problem (Q1919781) (← links)
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem (Q2367016) (← links)
• Comparison of dynamic routeing techniques for automated guided vehicle system (Q4399078) (← links)
• A generalized exchange heuristic for the capacitated vehicle routing problem (Q4697853) (← links)