Martin W P Savelsbergh - Publications

Affiliations: 
Georgia Institute of Technology, Atlanta, GA 
Area:
Operations Research, System Science Engineering, Industrial Engineering

46 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Yildiz B, Savelsbergh M. Pricing for delivery time flexibility Transportation Research Part B-Methodological. 133: 230-256. DOI: 10.1016/J.Trb.2020.01.004  0.481
2020 Gansterer M, Hartl RF, Savelsbergh M. The value of information in auction-based carrier collaborations International Journal of Production Economics. 221: 107485. DOI: 10.1016/J.Ijpe.2019.09.006  0.328
2019 Yildiz B, Savelsbergh M. Service and Capacity Planning in Crowd-Sourced Delivery Transportation Research Part C-Emerging Technologies. 100: 177-199. DOI: 10.1016/J.Trc.2019.01.021  0.333
2019 Paul J, Agatz N, Savelsbergh M. Optimizing Omni-Channel Fulfillment with Store Transfers Transportation Research Part B-Methodological. 129: 381-396. DOI: 10.1016/J.Trb.2019.10.002  0.38
2019 Ozbaygin G, Savelsbergh M. An iterative re-optimization framework for the dynamic vehicle routing problem with roaming delivery locations Transportation Research Part B-Methodological. 128: 207-235. DOI: 10.1016/J.Trb.2019.08.004  0.505
2018 Huang Y, Savelsbergh M, Zhao L. Designing logistics systems for home delivery in densely populated urban areas Transportation Research Part B-Methodological. 115: 95-125. DOI: 10.1016/J.Trb.2018.07.006  0.379
2017 Reyes D, Savelsbergh M, Toriello A. Vehicle routing with roaming delivery locations Transportation Research Part C-Emerging Technologies. 80: 71-91. DOI: 10.1016/J.Trc.2017.04.003  0.448
2017 Ozbaygin G, Karasan OE, Savelsbergh M, Yaman H. A branch-and-price algorithm for the vehicle routing problem with roaming delivery locations Transportation Research Part B-Methodological. 100: 115-137. DOI: 10.1016/J.Trb.2017.02.003  0.483
2016 Stiglic M, Agatz N, Savelsbergh M, Gradisar M. Making dynamic ride-sharing work: The impact of driver and rider flexibility Transportation Research Part E-Logistics and Transportation Review. 91: 190-207. DOI: 10.1016/J.Tre.2016.04.010  0.38
2016 Angelelli E, Arsik I, Morandi V, Savelsbergh M, Speranza MG. Proactive route guidance to avoid congestion Transportation Research Part B-Methodological. 94: 1-21. DOI: 10.1016/J.Trb.2016.08.015  0.416
2016 Boland N, Fischetti M, Monaci M, Savelsbergh M. Proximity Benders: a decomposition heuristic for stochastic programs Journal of Heuristics. 22: 181-198. DOI: 10.1007/S10732-015-9306-1  0.425
2015 Stiglic M, Agatz N, Savelsbergh M, Gradisar M. The Benefits of Meeting Points in Ride-sharing Systems Erim Report Series Research in Management Erasmus Research Institute of Management. DOI: 10.2139/Ssrn.2567274  0.364
2015 Charkhgard H, Savelsbergh M. Efficient algorithms for travelling salesman problems arising in warehouse order picking Anziam Journal. 57: 166-174. DOI: 10.1017/S1446181115000140  0.468
2015 Stiglic M, Agatz N, Savelsbergh M, Gradisar M. The benefits of meeting points in ride-sharing systems Transportation Research Part B-Methodological. 82: 36-53. DOI: 10.1016/J.Trb.2015.07.025  0.364
2015 Lee A, Savelsbergh M. Dynamic ridesharing: Is there a role for dedicated drivers? Transportation Research Part B-Methodological. 81: 483-497. DOI: 10.1016/J.Trb.2015.02.013  0.414
2015 Kuyzu G, Akyol ÇG, Ergun Ö, Savelsbergh M. Bid price optimization for truckload carriers in simultaneous transportation procurement auctions Transportation Research Part B: Methodological. 73: 34-58. DOI: 10.1016/J.Trb.2014.11.012  0.427
2015 Boland N, Savelsbergh M, Waterer H. A decision support tool for generating shipping data for the Hunter Valley coal chain Computers & Operations Research. 53: 54-67. DOI: 10.1016/J.Cor.2014.07.016  0.351
2015 Keshavarz T, Savelsbergh M, Salmasi N. A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties Applied Mathematical Modelling. 39. DOI: 10.1016/J.Apm.2015.01.069  0.415
2014 Milburn AB, Hewitt M, Griffin P, Savelsbergh M. The value of remote monitoring systems for treatment of chronic disease Iie Transactions On Healthcare Systems Engineering. 4: 65-79. DOI: 10.1080/19488300.2014.901995  0.301
2013 Erera A, Hewitt M, Savelsbergh M, Zhang Y. Improved Load Plan Design Through Integer Programming Based Local Search Transportation Science. 47: 412-427. DOI: 10.1287/Trsc.1120.0441  0.436
2013 Özener OO, Ergun O, Savelsbergh M. Allocating cost of service to customers in inventory routing Operations Research. 61: 112-125. DOI: 10.1287/Opre.1120.1130  0.408
2013 Agatz N, Campbell AM, Fleischmann M, Van Nunen J, Savelsbergh M. Revenue management opportunities for Internet retailers Journal of Revenue and Pricing Management. 12: 128-138. DOI: 10.1057/Rpm.2012.51  0.379
2013 Hewitt M, Nemhauser G, Savelsbergh M, Song J. A branch-and-price guided search approach to maritime inventory routing Computers & Operations Research. 40: 1410-1419. DOI: 10.1016/J.Cor.2012.09.010  0.687
2012 Li Y, Nemhauser G, Savelsbergh M. Pricing for production and delivery flexibility in single-item lot-sizing Computers & Operations Research. 39: 3408-3419. DOI: 10.1016/J.Cor.2012.05.003  0.615
2012 Goel A, Archetti C, Savelsbergh M. Truck driver scheduling in Australia Computers & Operations Research. 39: 1122-1132. DOI: 10.1016/J.Cor.2011.05.021  0.448
2011 Agatz N, Campbell A, Fleischmann M, Savelsbergh M. Time slot management in attended home delivery Transportation Science. 45: 435-449. DOI: 10.1287/Trsc.1100.0346  0.458
2011 Özener OO, Ergun O, Savelsbergh M. Lane-exchange mechanisms for truckload carrier collaboration Transportation Science. 45: 1-17. DOI: 10.1287/Trsc.1100.0327  0.386
2010 Erera AL, Morales JC, Savelsbergh M. The vehicle routing problem with stochastic demand and duration constraints Transportation Science. 44: 474-492. DOI: 10.1287/Trsc.1100.0324  0.664
2010 Ahmed S, Gozbasi O, Savelsbergh M, Crocker I, Fox T, Schreibmann E. An Automated Intensity-Modulated Radiation Therapy Planning System Informs Journal On Computing. 22: 568-583. DOI: 10.1287/Ijoc.1090.0374  0.31
2010 Toriello A, Nemhauser G, Savelsbergh M. Decomposing inventory routing problems with approximate value functions Naval Research Logistics. 57: 718-727. DOI: 10.1002/Nav.20433  0.613
2009 Archetti C, Savelsbergh M. The Trip Scheduling Problem Transportation Science. 43: 417-431. DOI: 10.1287/Trsc.1090.0278  0.433
2009 Erera AL, Morales JC, Savelsbergh M. Robust optimization for empty repositioning problems Operations Research. 57: 468-483. DOI: 10.1287/Opre.1080.0650  0.61
2009 Kilinç-Karzan F, Toriello A, Ahmed S, Nemhauser G, Savelsbergh M. Approximating the stability region for binary mixed-integer programs Operations Research Letters. 37: 250-254. DOI: 10.1016/J.Orl.2009.04.001  0.543
2009 Erera AL, Savelsbergh M, Uyar E. Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints Networks. 54: 270-283. DOI: 10.1002/Net.V54:4  0.707
2008 Gozbasi O, Ahmed S, Crocker I, Schreibmann E, Fox T, Savelsbergh M. SU‐GG‐T‐118: Fast Multicriteria IMRT Beam‐Fluence Map Optimization Using CVaR Linear Programming Methods Medical Physics. 35: 2753-2753. DOI: 10.1118/1.2961870  0.379
2008 Erera A, Karacık B, Savelsbergh M. A dynamic driver management scheme for less-than-truckload carriers Computers & Operations Research. 35: 3397-3411. DOI: 10.1016/J.Cor.2007.01.019  0.706
2008 Savelsbergh M, Song J. An optimization algorithm for the inventory routing problem with continuous moves Computers & Operations Research. 35: 2266-2282. DOI: 10.1016/J.Cor.2006.10.020  0.609
2008 Savelsbergh M. Comments on: Intensity modulated radiation therapy treatment plan optimization Top. 16: 253-255. DOI: 10.1007/S11750-008-0069-9  0.339
2007 Song J, Savelsbergh M. Performance Measurement for Inventory Routing Transportation Science. 41: 44-54. DOI: 10.1287/Trsc.1060.0175  0.502
2007 Ergun O, Kuyzu G, Savelsbergh M. Reducing truckload transportation costs through collaboration Transportation Science. 41: 206-221. DOI: 10.1287/Trsc.1060.0169  0.403
2006 Campbell AM, Savelsbergh M. Incentive Schemes for Attended Home Delivery Services Transportation Science. 40: 327-341. DOI: 10.1287/Trsc.1050.0136  0.374
2005 Erera AL, Morales JC, Savelsbergh M. Global intermodal tank container management for the chemical industry Transportation Research Part E: Logistics and Transportation Review. 41: 551-566. DOI: 10.1016/J.Tre.2005.06.004  0.613
2004 Campbell AM, Savelsbergh M. Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems Transportation Science. 38: 369-378. DOI: 10.1287/Trsc.1030.0046  0.455
2002 Hunsaker B, Savelsbergh M. Efficient feasibility testing for dial-a-ride problems Operations Research Letters. 30: 169-173. DOI: 10.1016/S0167-6377(02)00120-7  0.496
1998 Savelsbergh M, Sol M. Drive: Dynamic Routing of Independent Vehicles Operations Research. 46: 474-490. DOI: 10.1287/Opre.46.4.474  0.428
1993 Kindervater G, Lenstra JK, Savelsbergh M. Sequential and parallel local search for the time-constrained traveling salesman problem Discrete Applied Mathematics. 42: 211-225. DOI: 10.1016/0166-218X(93)90047-R  0.454
Show low-probability matches.