Pages that link to "Item:Q4021367"

The following pages link to Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems (Q4021367):

Displaying 16 items.

• Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees (Q489718) (← links)
• A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing (Q494936) (← links)
• Improved bounds for vehicle routing solutions (Q865747) (← links)
• Analysis of heuristics for the design of tree networks (Q1197773) (← links)
• A genetic algorithm for service level based vehicle scheduling (Q1268204) (← links)
• Topological design of ring networks (Q1318461) (← links)
• Optimization of multi-feeder (depot) printed circuit board manufacturing with error guarantees. (Q1405236) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• A tabu search heuristic for the multi-depot vehicle routing problem (Q1919200) (← links)
• Approximation algorithms for the load-balanced capacitated vehicle routing problem (Q2043586) (← links)
• Bifactor approximation for location routing with vehicle and facility capacities (Q2171591) (← links)
• Locating Depots for Capacitated Vehicle Routing (Q3088097) (← links)
• Bounds for the general capacitated routing problem (Q5287450) (← links)
• Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems (Q5326795) (← links)
• Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems (Q5443715) (← links)
• Iterated tour partitioning for Euclidean capacitated vehicle routing (Q6076221) (← links)