| Local search in combinatorial optimization GAP Kindervater, MWP Savelsbergh Wiley, Chichester, ch. Vehicle Routing, 1997 | 3403* | 1997 |
| Branch-and-price: Column generation for solving huge integer programs C Barnhart, EL Johnson, GL Nemhauser, MWP Savelsbergh, PH Vance Operations Research, 316-329, 1998 | 3155 | 1998 |
| The general pickup and delivery problem MWP Savelsbergh, M Sol Transportation science 29 (1), 17-29, 1995 | 1424 | 1995 |
| Optimization for dynamic ride-sharing: A review N Agatz, A Erera, M Savelsbergh, X Wang European Journal of Operational Research 223 (2), 295-303, 2012 | 1169 | 2012 |
| Local search in routing problems with time windows MWP Savelsbergh Annals of Operations research 4 (1), 285-305, 1985 | 1066 | 1985 |
| Vehicle routing JF Cordeau, G Laporte, MWP Savelsbergh, D Vigo Transportation, handbooks in operations research and management science 14 …, 2007 | 875 | 2007 |
| 50th anniversary invited article—city logistics: Challenges and opportunities M Savelsbergh, T Van Woensel Transportation science 50 (2), 579-590, 2016 | 703 | 2016 |
| Dynamic ride-sharing: A simulation study in metro atlanta N Agatz, AL Erera, MWP Savelsbergh, X Wang Procedia-Social and Behavioral Sciences 17, 532-550, 2011 | 703 | 2011 |
| A branch-and-price algorithm for the generalized assignment problem M Savelsbergh Operations Research, 831-841, 1997 | 673 | 1997 |
| The vehicle routing problem with time windows: minimizing route duration MWP Savelsbergh Eindhoven University of Technology, Department of Mathematics and Computing …, 1991 | 639 | 1991 |
| Preprocessing and probing techniques for mixed integer programming problems MW Savelsbergh ORSA Journal on Computing 6, 445-445, 1994 | 552 | 1994 |
| A computational study of search strategies for mixed integer programming JT Linderoth, MWP Savelsbergh INFORMS Journal on Computing 11 (2), 173-187, 1999 | 521 | 1999 |
| DRIVE: Dynamic routing of independent vehicles M Savelsbergh, M Sol Operations Research, 474-490, 1998 | 485 | 1998 |
| The stochastic inventory routing problem with direct deliveries AJ Kleywegt, VS Nori, MWP Savelsbergh Transportation Science 36 (1), 94-118, 2002 | 478 | 2002 |
| A decomposition approach for the inventory-routing problem AM Campbell, MWP Savelsbergh Transportation Science 38 (4), 488-502, 2004 | 476 | 2004 |
| Vehicle routing with time windows: Optimization and approximation M Desrochers, JK Lenstra, MWP Savelsbergh, F Soumis Department of Operations Research and System Theory, Centrum voor Wiskunde …, 1987 | 440 | 1987 |
| The inventory routing problem A Campbell, L Clarke, A Kleywegt, MWP Savelsbergh Fleet management and logistics, 95-113, 1998 | 401 | 1998 |
| The benefits of meeting points in ride-sharing systems M Stiglic, N Agatz, M Savelsbergh, M Gradisar Transportation Research Part B: Methodological 82, 36-53, 2015 | 362 | 2015 |
| Efficient insertion heuristics for vehicle routing and scheduling problems AM Campbell, M Savelsbergh Transportation science 38 (3), 369-378, 2004 | 351 | 2004 |
| The vehicle routing problem with occasional drivers C Archetti, M Savelsbergh, MG Speranza European Journal of Operational Research 254 (2), 472-480, 2016 | 331 | 2016 |
George NemhauserProfessor, Georgia Institute of TechnologyVerified email at isye.gatech.edu
