Models and Algorithms for Carsharing Systems and Related Problems

Electronic Notes in Discrete Mathematics

Volumn 44, Issue , 2013, Pages 201-206

  Krumke, Sven O ^a   Quilliot, Alain ^b   Wagler, Annegret K ^b   Wegener, Jan Thierry ^b  

^a Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

^b UNIVERSITÉ CLERMONT AUVERGNE   (France)

Author keywords

Carsharing; Competitive analysis; Pickup and delivery problem

Indexed keywords

EID: 84887191983     PISSN: None     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2013.10.031     Document Type: Article

References (4)

1. Benchimol Mike, Benchimol Pascal, Chappert Arnaud de la Taille Benoît, Laroche Fabien, Meunier Frédéric, Robinet Ludovic Balancing the stations of a self service "bike hire" system, RAIRO. Operations Research 2011, 45:37-61.
2. Borodin A., El-Yaniv R. Online computation and competitive analysis 1998, Cambridge University Press.
3. Charikar M., Chekuri C., Goel A., Guha S., Plotkin S. Approximating a finite metric by a small number of tree metrics. Proceedings of the 39th Annual ACM Symposium on the Theory of Computing 1998, 379-388.
4. Fakcharoenphol J., Rao S., Talwar K. A tight bound on approximating arbitrary metrics by tree metrics. Proceedings of the 35th Annual ACM Symposium on the Theory of Computing 2003, 448-455.