Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

27

APPROX
2007
Springer

favoriteEmaildiscussreport

106views Algorithms» more APPROX 2007»

Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems

14 years 5 months ago

Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems

Download www.andrew.cmu.edu

Viswanath Nagarajan, R. Ravi

Real-time Traffic

Algorithms | APPROX 2007 |

claim paper

Related Content

» Improved bounds for vehicle routing solutions

» Differential Approximation for Some Routing Problems

» Optimization of Multiple Vehicle Routing Problems using Approximation Algorithms

» MultiObjective Genetic Algorithms for Vehicle Routing Problem with Time Windows

» Approximations for minimum and minmax vehicle routing problems

» Approximation algorithm for minimizing total latency in machine scheduling with deliveries

» The Train Delivery Problem Vehicle Routing Meets Bin Packing

» A memetic algorithm for a vehicle routing problem with backhauls

» Formulations and exact algorithms for the vehicle routing problem with time windows

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	APPROX
Authors	Viswanath Nagarajan, R. Ravi

Comments (0)