Pages that link to "Item:Q865747"

The following pages link to Improved bounds for vehicle routing solutions (Q865747):

Displaying 19 items.

• Differential approximation algorithm of FSMVRP (Q277103) (← links)
• Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem (Q633484) (← links)
• A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands (Q783689) (← links)
• Improved lower bounds for the split delivery vehicle routing problem (Q991469) (← links)
• Minimizing customers' waiting time in a vehicle routing problem with unit demands (Q1742415) (← links)
• Approximation algorithms for the load-balanced capacitated vehicle routing problem (Q2043586) (← links)
• A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering (Q2118143) (← links)
• Compact, provably-good LPs for orienteering and regret-bounded vehicle routing (Q2401157) (← links)
• Capacitated vehicle routing with nonuniform speeds (Q2800377) (← links)
• (Q3525437) (← links)
• A Fast $$(2 + 2/7)$$-Approximation Algorithm for Capacitated Cycle Covering (Q5041760) (← links)
• Extensions of the Petal Method for Vehicle Routeing (Q5287233) (← links)
• Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems (Q5326795) (← links)
• Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route (Q5326796) (← links)
• Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems (Q5443715) (← links)
• Improving the approximation ratio for capacitated vehicle routing (Q5918417) (← links)
• Improving the approximation ratio for capacitated vehicle routing (Q5925635) (← links)
• Iterated tour partitioning for Euclidean capacitated vehicle routing (Q6076221) (← links)
• Improved approximation algorithms for multidepot capacitated vehicle routing (Q6591657) (← links)