Martin W. P. Savelsbergh

ORCID

Publication Activity (10 Years)

Years Active: 1985-2024
Publications (10 Years): 70

Top Venues

Transp. Sci.

Eur. J. Oper. Res.

EURO J. Transp. Logist.

INFORMS J. Comput.

Publications

Ramon Auad, Alan L. Erera, Martin W. P. Savelsbergh
Dynamic Courier Capacity Acquisition in Rapid Delivery Systems: A Deep Q-Learning Approach. Transp. Sci. 58 (1) (2024)
Adam Behrendt, Martin W. P. Savelsbergh, He Wang
A Prescriptive Machine Learning Method for Courier Scheduling on Crowdsourced Delivery Platforms. Transp. Sci. 57 (4) (2023)
Haotian Wu, Ian Herszterg, Martin W. P. Savelsbergh, Yixiao Huang
Service Network Design for Same-Day Delivery with Hub Capacity Constraints. Transp. Sci. 57 (1) (2023)
Baris Yildiz, Martin W. P. Savelsbergh, Ali K. Dogru
Transshipment network design for express air cargo operations in China. EURO J. Transp. Logist. 12 (2023)
Ahmad Baubaid, Natashia Boland, Martin W. P. Savelsbergh
The Dynamic Freight Routing Problem for Less-Than-Truckload Carriers. Transp. Sci. 57 (3) (2023)
Yang Wang, Lei Zhao, Martin W. P. Savelsbergh, Shengnan Wu
Multi-Period Workload Balancing in Last-Mile Urban Delivery. Transp. Sci. 56 (5) (2022)
Pedro Munari, Martin W. P. Savelsbergh
Compact Formulations for Split Delivery Routing Problems. Transp. Sci. 56 (4) (2022)
Yu Yang, Yassine Ridouane, Natashia Boland, Alan L. Erera, Martin W. P. Savelsbergh
Substitution-based equipment balancing in service networks with multiple equipment types. Eur. J. Oper. Res. 300 (3) (2022)
Edward Yuhang He, Natashia Boland, George L. Nemhauser, Martin W. P. Savelsbergh
Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems. INFORMS J. Comput. 34 (2) (2022)
Felipe Lagos, Natashia Boland, Martin W. P. Savelsbergh
Dynamic discretization discovery for solving the Continuous Time Inventory Routing Problem with Out-and-Back Routes. Comput. Oper. Res. 141 (2022)
Edward He, Natashia Boland, George L. Nemhauser, Martin W. P. Savelsbergh
An exact algorithm for the service network design problem with hub capacity constraints. Networks 80 (4) (2022)
Baris Yildiz, Natashia Boland, Martin W. P. Savelsbergh
Decomposition Branching for Mixed Integer Programming. Oper. Res. 70 (3) (2022)
Marlin W. Ulmer, Alan L. Erera, Martin W. P. Savelsbergh
Dynamic service area sizing in urban delivery. OR Spectr. 44 (3) (2022)
Baris Yildiz, Martin W. P. Savelsbergh
Optimizing package express operations in China. Eur. J. Oper. Res. 300 (1) (2022)
Martin W. P. Savelsbergh, Marlin W. Ulmer
Challenges and opportunities in crowdsourced delivery planning and operations. 4OR 20 (1) (2022)
Yu Yang, Natashia Boland, Bistra Dilkina, Martin W. P. Savelsbergh
Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems. Eur. J. Oper. Res. 301 (3) (2022)
Ian Herszterg, Yassine Ridouane, Natashia Boland, Alan L. Erera, Martin W. P. Savelsbergh
Near real-time loadplan adjustments for less-than-truckload carriers. Eur. J. Oper. Res. 301 (3) (2022)
Martin W. P. Savelsbergh
Thank You and Goodbye. Transp. Sci. 55 (1) (2021)
Enrico Angelelli, Valentina Morandi, Martin W. P. Savelsbergh, Maria Grazia Speranza
System optimal routing of traffic flows with user constraints using linear programming. Eur. J. Oper. Res. 293 (3) (2021)
Jasmin Grabenschweiger, Karl F. Doerner, Richard F. Hartl, Martin W. P. Savelsbergh
The vehicle routing problem with heterogeneous locker boxes. Central Eur. J. Oper. Res. 29 (1) (2021)
Ahmad Baubaid, Natashia Boland, Martin W. P. Savelsbergh
The Value of Limited Flexibility in Service Network Designs. Transp. Sci. 55 (1) (2021)
Edward He, Natashia Boland, George L. Nemhauser, Martin W. P. Savelsbergh
Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting. INFORMS J. Comput. 33 (3) (2021)
Yu Yang, Natashia Boland, Martin W. P. Savelsbergh
Multivariable Branching: A 0-1 Knapsack Problem Case Study. INFORMS J. Comput. 33 (4) (2021)
Luke Marshall, Natashia Boland, Martin W. P. Savelsbergh, Mike Hewitt
Interval-Based Dynamic Discretization Discovery for Solving the Continuous-Time Service Network Design Problem. Transp. Sci. 55 (1) (2021)
Felipe Lagos, Natashia Boland, Martin W. P. Savelsbergh
The Continuous-Time Inventory-Routing Problem. Transp. Sci. 54 (2) (2020)
Marlin W. Ulmer, Martin W. P. Savelsbergh
Workforce Scheduling in the Era of Crowdsourced Delivery. Transp. Sci. 54 (4) (2020)
Afonso H. Sampaio, Martin W. P. Savelsbergh, Lucas P. Veelenturf, Tom Van Woensel
Delivery systems with crowd-sourced drivers: A pickup and delivery problem with transfers. Networks 76 (2) (2020)
Pedro Munari, Martin W. P. Savelsbergh
A Column Generation-Based Heuristic for the Split Delivery Vehicle Routing Problem with Time Windows. Oper. Res. Forum 1 (4) (2020)
Tyler A. Perini, Natashia Boland, Diego Pecin, Martin W. P. Savelsbergh
A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method. INFORMS J. Comput. 32 (1) (2020)
Duc Minh Vu, Mike Hewitt, Natashia Boland, Martin W. P. Savelsbergh
Dynamic Discretization Discovery for Solving the Time-Dependent Traveling Salesman Problem with Time Windows. Transp. Sci. 54 (3) (2020)
Gleb Belov, Natashia L. Boland, Martin W. P. Savelsbergh, Peter J. Stuckey
Logistics optimization for a coal supply chain. J. Heuristics 26 (2) (2020)
Iman Dayarian, Martin W. P. Savelsbergh, John-Paul Clarke
Same-Day Delivery with Drone Resupply. Transp. Sci. 54 (1) (2020)
Alejandro Estrada-Moreno, Martin W. P. Savelsbergh, Angel A. Juan, Javier Panadero
Biased-randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility. Int. Trans. Oper. Res. 26 (4) (2019)
Baris Yildiz, Martin W. P. Savelsbergh
Provably High-Quality Solutions for the Meal Delivery Routing Problem. Transp. Sci. 53 (5) (2019)
Martin W. P. Savelsbergh, Masoud Talebian
Cost allocation under competition: a new rail access charging policy. EURO J. Transp. Logist. 8 (5) (2019)
Natashia Boland, Mike Hewitt, Luke Marshall, Martin W. P. Savelsbergh
The price of discretizing time: a study in service network design. EURO J. Transp. Logist. 8 (2) (2019)
Mateus Rocha de Paula, Natashia Boland, Andreas T. Ernst, Alexandre Mendes, Martin W. P. Savelsbergh
Throughput optimisation in a coal export system with multiple terminals and shared resources. Comput. Ind. Eng. 134 (2019)
Natashia Boland, Hadi Charkhgard, Martin W. P. Savelsbergh
Preprocessing and cut generation techniques for multi-objective binary programming. Eur. J. Oper. Res. 274 (3) (2019)
Ahmad Baubaid, Natashia Boland, Martin W. P. Savelsbergh
Dealing with Demand Uncertainty in Service Network and Load Plan Design. CPAIOR (2018)
Edward He, Natashia Boland, George L. Nemhauser, Martin W. P. Savelsbergh
A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem. CPAIOR (2018)
Hadi Charkhgard, Martin W. P. Savelsbergh, Masoud Talebian
A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints. Comput. Oper. Res. 89 (2018)
Yves Crama, Mahmood Rezaei, Martin W. P. Savelsbergh, Tom Van Woensel
Stochastic Inventory Routing for Perishable Products. Transp. Sci. 52 (3) (2018)
Mitja Stiglic, Niels A. H. Agatz, Martin W. P. Savelsbergh, Mirko Gradisar
Enhancing urban mobility: Integrating ride-sharing and public transit. Comput. Oper. Res. 90 (2018)
Damián Reyes, Alan L. Erera, Martin W. P. Savelsbergh
Complexity of routing problems with release dates and deadlines. Eur. J. Oper. Res. 266 (1) (2018)
Hadi Charkhgard, Martin W. P. Savelsbergh, Masoud Talebian
Nondominated Nash points: application of biobjective mixed integer programming. 4OR 16 (2) (2018)
Mateus Rocha de Paula, Natashia Boland, Andreas T. Ernst, Alexandre Mendes, Martin W. P. Savelsbergh
Maximising Throughput in a Complex Coal Export System. CoRR (2018)
Konrad Engel, Thomas Kalinowski, Martin W. P. Savelsbergh
Incremental Network Design with Minimum Spanning Trees. J. Graph Algorithms Appl. 21 (4) (2017)
Thomas Kalinowski, Reena Kapoor, Martin W. P. Savelsbergh
Scheduling reclaimers serving a stock pad at a coal terminal. J. Sched. 20 (1) (2017)
Marco Colombi, Renata Mansini, Martin W. P. Savelsbergh
The generalized independent set problem: Polyhedral analysis and solution approaches. Eur. J. Oper. Res. 260 (1) (2017)
Natashia Boland, Mike Hewitt, Duc Minh Vu, Martin W. P. Savelsbergh
Solving the Traveling Salesman Problem with Time Windows Through Dynamically Generated Time-Expanded Networks. CPAIOR (2017)
Alan Lee, Martin W. P. Savelsbergh
An extended demand responsive connector. EURO J. Transp. Logist. 6 (1) (2017)
Gianfranco Guastaroba, Martin W. P. Savelsbergh, Maria Grazia Speranza
Adaptive Kernel Search: A heuristic for solving Mixed Integer linear Programs. Eur. J. Oper. Res. 263 (3) (2017)
Natashia Boland, Mike Hewitt, Luke Marshall, Martin W. P. Savelsbergh
The Continuous-Time Service Network Design Problem. Oper. Res. 65 (5) (2017)
Natashia Boland, Hadi Charkhgard, Martin W. P. Savelsbergh
The Quadrant Shrinking Method: A simple and efficient algorithm for solving tri-objective integer programs. Eur. J. Oper. Res. 260 (3) (2017)
Natashia Boland, Hadi Charkhgard, Martin W. P. Savelsbergh
A new method for optimizing a linear function over the efficient set of a multiobjective integer program. Eur. J. Oper. Res. 260 (3) (2017)
Claudia Archetti, Martin W. P. Savelsbergh, M. Grazia Speranza
The Vehicle Routing Problem with Occasional Drivers. Eur. J. Oper. Res. 254 (2) (2016)
Natashia Boland, Matteo Fischetti, Michele Monaci, Martin W. P. Savelsbergh
Proximity Benders: a decomposition heuristic for stochastic programs. J. Heuristics 22 (2) (2016)
Elin E. Halvorsen-Weare, Martin W. P. Savelsbergh
The bi-objective mixed capacitated general routing problem with different route balance criteria. Eur. J. Oper. Res. 251 (2) (2016)
Martin W. P. Savelsbergh
Turns Fifty. Transp. Sci. 50 (1) (2016)
Enrico Angelelli, Thomas Kalinowski, Reena Kapoor, Martin W. P. Savelsbergh
A reclaimer scheduling problem arising in coal stockyard management. J. Sched. 19 (5) (2016)
Kathleen Lindsey, Alan L. Erera, Martin W. P. Savelsbergh
Improved Integer Programming-Based Neighborhood Search for Less-Than-Truckload Load Plan Design. Transp. Sci. 50 (4) (2016)
Natashia Boland, Hadi Charkhgard, Martin W. P. Savelsbergh
-shape search method for triobjective integer programming. Math. Program. Comput. 8 (2) (2016)
Martin W. P. Savelsbergh, Tom Van Woensel
50th Anniversary Invited Article - City Logistics: Challenges and Opportunities. Transp. Sci. 50 (2) (2016)
Martin W. P. Savelsbergh, Hamish Waterer, Matthew Dall, Chad Moffiet
Possession assessment and capacity evaluation of the Central Queensland Coal Network. EURO J. Transp. Logist. 4 (1) (2015)
Martin W. P. Savelsbergh
Editorial Statement. Transp. Sci. 49 (2) (2015)
Martin W. P. Savelsbergh, Olivia J. Smith
Cargo assembly planning. EURO J. Transp. Logist. 4 (3) (2015)
Natashia Boland, Hadi Charkhgard, Martin W. P. Savelsbergh
A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method. INFORMS J. Comput. 27 (4) (2015)
Natashia Boland, Martin W. P. Savelsbergh, Hamish Waterer
A decision support tool for generating shipping data for the Hunter Valley coal chain. Comput. Oper. Res. 53 (2015)
Thomas Kalinowski, Dmytro Matsypura, Martin W. P. Savelsbergh
Incremental network design with maximum flows. Eur. J. Oper. Res. 242 (1) (2015)
Natashia Boland, Hadi Charkhgard, Martin W. P. Savelsbergh
A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method. INFORMS J. Comput. 27 (4) (2015)
Matthew Baxter, Tarek Elgindy, Andreas T. Ernst, Thomas Kalinowski, Martin W. P. Savelsbergh
Incremental network design with shortest paths. Eur. J. Oper. Res. 238 (3) (2014)
Natashia L. Boland, Andrew C. Eberhard, Faramroze G. Engineer, Matteo Fischetti, Martin W. P. Savelsbergh, Angelos Tsoukalas
Boosting the feasibility pump. Math. Program. Comput. 6 (3) (2014)
Saif Benjaafar, Martin W. P. Savelsbergh
Carbon-aware transport and logistics. EURO J. Transp. Logist. 3 (1) (2014)
Gleb Belov, Natashia Boland, Martin W. P. Savelsbergh, Peter J. Stuckey
Local Search for a Cargo Assembly Planning Problem. CPAIOR (2014)
Masoud Talebian, Natashia Boland, Martin W. P. Savelsbergh
Pricing to accelerate demand learning in dynamic assortment planning for perishable products. Eur. J. Oper. Res. 237 (2) (2014)
Natashia Boland, Hadi Charkhgard, Martin W. P. Savelsbergh
The Triangle Splitting Method for Biobjective Mixed Integer Programming. IPCO (2014)
Enrico Angelelli, Thomas Kalinowski, Reena Kapoor, Martin W. P. Savelsbergh
Reclaimer Scheduling: Complexity and Algorithms. CoRR (2014)
Olivia J. Smith, Martin W. P. Savelsbergh
A note on shortest path problems with forbidden paths. Networks 63 (3) (2014)
Mike Hewitt, George L. Nemhauser, Martin W. P. Savelsbergh, Jin-Hwa Song
A branch-and-price guided search approach to maritime inventory routing. Comput. Oper. Res. 40 (5) (2013)
Alan L. Erera, Michael Hewitt, Martin W. P. Savelsbergh, Yang Zhang
Improved Load Plan Design Through Integer Programming Based Local Search. Transp. Sci. 47 (3) (2013)
Mike Hewitt, George L. Nemhauser, Martin W. P. Savelsbergh
Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem. INFORMS J. Comput. 25 (2) (2013)
Alan L. Erera, Michael Hewitt, Martin W. P. Savelsbergh, Yang Zhang
Creating schedules and computing operating costs for LTL load plans. Comput. Oper. Res. 40 (3) (2013)
Menal Guzelsoy, George L. Nemhauser, Martin W. P. Savelsbergh
Restrict-and-relax search for 0-1 mixed-integer programs. EURO J. Comput. Optim. 1 (1-2) (2013)
Konrad Engel, Thomas Kalinowski, Martin W. P. Savelsbergh
Incremental Network Design with Minimum Spanning Trees. CoRR (2013)
Thomas Kalinowski, Dmytro Matsypura, Martin W. P. Savelsbergh
Incremental Network Design with Maximum Flows. CoRR (2013)
Okan Örsan Özener, Özlem Ergun, Martin W. P. Savelsbergh
Allocating Cost of Service to Customers in Inventory Routing. Oper. Res. 61 (1) (2013)
Kathleen Lindsey, Alan L. Erera, Martin W. P. Savelsbergh
A pickup and delivery problem using crossdocks and truckload lane rates. EURO J. Transp. Logist. 2 (1-2) (2013)
José Antonio Carbajal, Alan L. Erera, Martin W. P. Savelsbergh
Balancing fleet size and repositioning costs in LTL trucking. Ann. Oper. Res. 203 (1) (2013)
Faramroze G. Engineer, George L. Nemhauser, Martin W. P. Savelsbergh, Jin-Hwa Song
The Fixed-Charge Shortest-Path Problem. INFORMS J. Comput. 24 (4) (2012)
Niels A. H. Agatz, Alan L. Erera, Martin W. P. Savelsbergh, Xing Wang
Optimization for dynamic ride-sharing: A review. Eur. J. Oper. Res. 223 (2) (2012)
Natashia Boland, Damon Gulczynski, Martin W. P. Savelsbergh
A stockyard planning problem. EURO J. Transp. Logist. 1 (3) (2012)
Dimitri J. Papageorgiou, Alejandro Toriello, George L. Nemhauser, Martin W. P. Savelsbergh
Fixed-Charge Transportation with Product Blending. Transp. Sci. 46 (2) (2012)
Yaxian Li, George L. Nemhauser, Martin W. P. Savelsbergh
Pricing for production and delivery flexibility in single-item lot-sizing. Comput. Oper. Res. 39 (12) (2012)
Asvin Goel, Claudia Archetti, Martin W. P. Savelsbergh
Truck driver scheduling in Australia. Comput. Oper. Res. 39 (5) (2012)
Faramroze G. Engineer, Kevin C. Furman, George L. Nemhauser, Martin W. P. Savelsbergh, Jin-Hwa Song
A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing. Oper. Res. 60 (1) (2012)
Mike Hewitt, George L. Nemhauser, Martin W. P. Savelsbergh
Branch-and-Price Guided Search - (Extended Abstract). ISCO (2012)
Faramroze G. Engineer, George L. Nemhauser, Martin W. P. Savelsbergh
Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem. INFORMS J. Comput. 23 (1) (2011)
Niels A. H. Agatz, Ann Melissa Campbell, Moritz Fleischmann, Martin W. P. Savelsbergh
Time Slot Management in Attended Home Delivery. Transp. Sci. 45 (3) (2011)
Okan Örsan Özener, Özlem Ergun, Martin W. P. Savelsbergh
Lane-Exchange Mechanisms for Truckload Carrier Collaboration. Transp. Sci. 45 (1) (2011)
Alan L. Erera, Juan C. Morales, Martin W. P. Savelsbergh
The Vehicle Routing Problem with Stochastic Demand and Duration Constraints. Transp. Sci. 44 (4) (2010)

Martin W. P. Savelsbergh.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Martin W. P. Savelsbergh