Edge exchanges in the degree-constrained minimum spanning tree problem. - Martin W. P. Savelsbergh; Ton Volgenant (Comput. Oper. Res., 1985)

Behind the screen: DSS from an OR point of view. - Jac M. Anthonisse; Jan Karel Lenstra; Martin W. P. Savelsbergh (Decis. Support Syst., 1988)

The Vehicle Routing Problem with Time Windows: Minimizing Route Duration. - Martin W. P. Savelsbergh (INFORMS J. Comput., 1992)

Sequential and Parallel Local Search for the Time-Constrained Traveling Salesman Problem. - Gerard A. P. Kindervater; Jan Karel Lenstra; Martin W. P. Savelsbergh (Discret. Appl. Math., 1993)

Preprocessing and Probing Techniques for Mixed Integer Programming Problems. - Martin W. P. Savelsbergh (INFORMS J. Comput., 1994)

MINTO, a mixed INTeger optimizer. - George L. Nemhauser; Martin W. P. Savelsbergh; Gabriele Sigismondi (Oper. Res. Lett., 1994)

Sequence Independent Lifting of Cover Inequalities. - Zonghao Gu; George L. Nemhauser; Martin W. P. Savelsbergh (IPCO, 1995)

The General Pickup and Delivery Problem. - Martin W. P. Savelsbergh; Marc Sol (Transp. Sci., 1995)

Towards a planning board generator. - Marc Wennink; Martin W. P. Savelsbergh (Decis. Support Syst., 1996)

A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems. - Alper Atamtürk; George L. Nemhauser; Martin W. P. Savelsbergh (J. Heuristics, 1996)

A Branch-and-Price Algorithm for the Generalized Assignment Problem. - Martin W. P. Savelsbergh (Oper. Res., 1997)

Lifted Cover Inequalities for 0-1 Integer Programs: Computation. - Zonghao Gu; George L. Nemhauser; Martin W. P. Savelsbergh (INFORMS J. Comput., 1998)

Branch-and-Price: Column Generation for Solving Huge Integer Programs. - Cynthia Barnhart; Ellis L. Johnson; George L. Nemhauser; Martin W. P. Savelsbergh; Pamela H. Vance (Oper. Res., 1998)

Drive: Dynamic Routing of Independent Vehicles. - Martin W. P. Savelsbergh; Marc Sol (Oper. Res., 1998)

Online Resource Minimization. - Anton J. Kleywegt; Vijay S. Nori; Martin W. P. Savelsbergh; Craig A. Tovey (SODA, 1999)

Towards a model and algorithm management system for vehicle routing and scheduling problems. - Martin Desrochers; Christopher V. Jones; Jan Karel Lenstra; Martin W. P. Savelsbergh; Leen Stougie (Decis. Support Syst., 1999)

Lifted Cover Inequalities for 0-1 Integer Programs: Complexity. - Zonghao Gu; George L. Nemhauser; Martin W. P. Savelsbergh (INFORMS J. Comput., 1999)

A Computational Study of Search Strategies for Mixed Integer Programming. - Jeff T. Linderoth; Martin W. P. Savelsbergh (INFORMS J. Comput., 1999)

A polyhedral approach to single-machine scheduling problems. - J. M. van den Akker; C. P. M. van Hoesel; Martin W. P. Savelsbergh (Math. Program., 1999)

Lifted flow cover inequalities for mixed 0-1 integer programs. - Zonghao Gu; George L. Nemhauser; Martin W. P. Savelsbergh (Math. Program., 1999)

Conflict graphs in solving integer programming problems. - Alper Atamtürk; George L. Nemhauser; Martin W. P. Savelsbergh (Eur. J. Oper. Res., 2000)

On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra. - Andrew J. Miller; George L. Nemhauser; Martin W. P. Savelsbergh (Eur. J. Oper. Res., 2000)

Time-Indexed Formulations for Machine Scheduling Problems: Column Generation. - Marjan van den Akker 001; Cor A. J. Hurkens; Martin W. P. Savelsbergh (INFORMS J. Comput., 2000)

Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition. - Ellis L. Johnson; George L. Nemhauser; Martin W. P. Savelsbergh (INFORMS J. Comput., 2000)

A Relational Modeling System for Linear and Integer Programming. - Alper Atamtürk; Ellis L. Johnson; Jeff T. Linderoth; Martin W. P. Savelsbergh (Oper. Res., 2000)

Sequence Independent Lifting in Mixed Integer Programming. - Zonghao Gu; George L. Nemhauser; Martin W. P. Savelsbergh (J. Comb. Optim., 2000)

The mixed vertex packing problem. - Alper Atamtürk; George L. Nemhauser; Martin W. P. Savelsbergh (Math. Program., 2000)

Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times. - Andrew J. Miller; George L. Nemhauser; Martin W. P. Savelsbergh (IPCO, 2001)

Scheduling projects with labor constraints. - Cristina C. B. Cavalcante; C. Carvalho de Souza; Martin W. P. Savelsbergh; Y. Wang; Laurence A. Wolsey (Discret. Appl. Math., 2001)

An Integer Programming Heuristic for Component Allocation in Printed Circuit Card Assembly Systems. - Gail W. DePuy; Martin W. P. Savelsbergh; Jane C. Ammons; Leon F. McGinnis (J. Heuristics, 2001)

A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems. - Jeff T. Linderoth; Eva K. Lee; Martin W. P. Savelsbergh (INFORMS J. Comput., 2001)

Valid inequalities for problems with additive variable upper bounds. - Alper Atamtürk; George L. Nemhauser; Martin W. P. Savelsbergh (Math. Program., 2001)

Inventory Routing in Practice. - Ann M. Campbell; Lloyd W. Clarke; Martin W. P. Savelsbergh (The Vehicle Routing Problem, 2002)

A branch and cut approach to the cardinality constrained circuit problem. - Petra Bauer; Jeff T. Linderoth; Martin W. P. Savelsbergh (Math. Program., 2002)

Polyhedral results for the edge capacity polytope. - Stan P. M. van Hoesel; Arie M. C. A. Koster; Robert L. M. J. van de Leensel; Martin W. P. Savelsbergh (Math. Program., 2002)

The relation of time indexed formulations of single machine scheduling problems to the node packing problem. - Hamish Waterer; Ellis L. Johnson; Paolo Nobili; Martin W. P. Savelsbergh (Math. Program., 2002)

Efficient feasibility testing for dial-a-ride problems. - Brady Hunsaker; Martin W. P. Savelsbergh (Oper. Res. Lett., 2002)

The Stochastic Inventory Routing Problem with Direct Deliveries. - Anton J. Kleywegt; Vijay S. Nori; Martin W. P. Savelsbergh (Transp. Sci., 2002)

Bidirected and unidirected capacity installation in telecommunication networks. - Stan P. M. van Hoesel; Arie M. C. A. Koster; Robert L. M. J. van de Leensel; Martin W. P. Savelsbergh (Discret. Appl. Math., 2003)

A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case. - Andrew J. Miller; George L. Nemhauser; Martin W. P. Savelsbergh (Math. Program., 2003)

On the polyhedral structure of a multi-item production planning model with setup times. - Andrew J. Miller; George L. Nemhauser; Martin W. P. Savelsbergh (Math. Program., 2003)

Optimal Online Algorithms for Minimax Resource Scheduling. - Brady Hunsaker; Anton J. Kleywegt; Martin W. P. Savelsbergh; Craig A. Tovey (SIAM J. Discret. Math., 2003)

Delivery Volume Optimization. - Ann Melissa Campbell; Martin W. P. Savelsbergh (Transp. Sci., 2004)

Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems. - Ann Melissa Campbell; Martin W. P. Savelsbergh (Transp. Sci., 2004)

A Decomposition Approach for the Inventory-Routing Problem. - Ann Melissa Campbell; Martin W. P. Savelsbergh (Transp. Sci., 2004)

Dynamic Programming Approximations for a Stochastic Inventory Routing Problem. - Anton J. Kleywegt; Vijay S. Nori; Martin W. P. Savelsbergh (Transp. Sci., 2004)

Integer-Programming Software Systems. - Alper Atamtürk; Martin W. P. Savelsbergh (Ann. Oper. Res., 2005)

An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems. - Martin W. P. Savelsbergh; R. N. Uma; Joel Wein (INFORMS J. Comput., 2005)

Decision Support for Consumer Direct Grocery Initiatives. - Ann Melissa Campbell; Martin W. P. Savelsbergh (Transp. Sci., 2005)

Minimum Vehicle Fleet Size Under Time-Window Constraints at a Container Terminal. - Iris F. A. Vis; René M. B. M. de Koster; Martin W. P. Savelsbergh (Transp. Sci., 2005)

A generic view of Dantzig-Wolfe decomposition in mixed integer programming. - François Vanderbeck; Martin W. P. Savelsbergh (Oper. Res. Lett., 2006)

Worst-Case Analysis for Split Delivery Vehicle Routing Problems. - Claudia Archetti; Martin W. P. Savelsbergh; Maria Grazia Speranza (Transp. Sci., 2006)

Incentive Schemes for Attended Home Delivery Services. - Ann Melissa Campbell; Martin W. P. Savelsbergh (Transp. Sci., 2006)

Chapter 7 Transportation on Demand. - Jean-François Cordeau; Gilbert Laporte; Jean-Yves Potvin; Martin W. P. Savelsbergh (Transportation, 2007)

Chapter 6 Vehicle Routing. - Jean-François Cordeau; Gilbert Laporte; Martin W. P. Savelsbergh; Daniele Vigo (Transportation, 2007)

Shipper collaboration. - Özlem Ergun; Gültekin Kuyzu; Martin W. P. Savelsbergh (Comput. Oper. Res., 2007)

Analysis of bounds for a capacitated single-item lot-sizing problem. - Jill R. Hardin; George L. Nemhauser; Martin W. P. Savelsbergh (Comput. Oper. Res., 2007)

Inventory routing with continuous moves. - Martin W. P. Savelsbergh; Jin-Hwa Song (Comput. Oper. Res., 2007)

Competitive analysis for dynamic multiperiod uncapacitated routing problems. - Enrico Angelelli; Maria Grazia Speranza; Martin W. P. Savelsbergh (Networks, 2007)

Competitive analysis of a dispatch policy for a dynamic multi-period routing problem. - Enrico Angelelli; Martin W. P. Savelsbergh; Maria Grazia Speranza (Oper. Res. Lett., 2007)

Reducing Truckload Transportation Costs Through Collaboration. - Özlem Ergun; Gültekin Kuyzu; Martin W. P. Savelsbergh (Transp. Sci., 2007)

Performance Measurement for Inventory Routing. - Jin-Hwa Song; Martin W. P. Savelsbergh (Transp. Sci., 2007)

A dynamic driver management scheme for less-than-truckload carriers. - Alan L. Erera; Burak Karacik; Martin W. P. Savelsbergh (Comput. Oper. Res., 2008)

An optimization algorithm for the inventory routing problem with continuous moves. - Martin W. P. Savelsbergh; Jin-Hwa Song (Comput. Oper. Res., 2008)

Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements. - Jill R. Hardin; George L. Nemhauser; Martin W. P. Savelsbergh (Discret. Optim., 2008)

An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem. - Claudia Archetti; Maria Grazia Speranza; Martin W. P. Savelsbergh (Transp. Sci., 2008)

Per-Seat, On-Demand Air Transportation Part I: Problem Description and an Integer Multicommodity Flow Model. - Daniel G. Espinoza; Renan Garcia; Marcos Goycoolea; George L. Nemhauser; Martin W. P. Savelsbergh (Transp. Sci., 2008)

Per-Seat, On-Demand Air Transportation Part II: Parallel Local Search. - Daniel G. Espinoza; Renan Garcia; Marcos Goycoolea; George L. Nemhauser; Martin W. P. Savelsbergh (Transp. Sci., 2008)

Using Branch-and-Price to Find High Quality Solutions Quickly. - George L. Nemhauser; Mike Hewitt; Martin W. P. Savelsbergh (Models and Algorithms for Optimization in Logistics, 2009)

Robust Optimization for Empty Repositioning Problems. - Alan L. Erera; Juan Carlos Morales; Martin W. P. Savelsbergh (Oper. Res., 2009)

Information-based branching schemes for binary linear mixed integer problems. - Fatma Kilinç-Karzan; George L. Nemhauser; Martin W. P. Savelsbergh (Math. Program. Comput., 2009)

ROUTE 2007: Recent advances in vehicle routing optimization. - Alan L. Erera; Martin W. P. Savelsbergh (Networks, 2009)

Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints. - Alan L. Erera; Martin W. P. Savelsbergh; Emrah Uyar (Networks, 2009)

Approximating the stability region for binary mixed-integer programs. - Fatma Kilinç-Karzan; Alejandro Toriello; Shabbir Ahmed 001; George L. Nemhauser; Martin W. P. Savelsbergh (Oper. Res. Lett., 2009)

Delivery strategies for blood products supplies. - Vera C. Hemmelmayr; Karl F. Doerner; Richard F. Hartl; Martin W. P. Savelsbergh (OR Spectr., 2009)

The Trip Scheduling Problem. - Claudia Archetti; Martin W. P. Savelsbergh (Transp. Sci., 2009)

A Hybrid Solution Approach for Ready-Mixed Concrete Delivery. - Verena Schmid; Karl F. Doerner; Richard F. Hartl; Martin W. P. Savelsbergh; Wolfgang Stoecher (Transp. Sci., 2009)

Branch and Price: Integer Programming with Column Generation. - Martin W. P. Savelsbergh (Encyclopedia of Optimization, 2009)

Vendor managed inventory for environments with stochastic product usage. - Vera C. Hemmelmayr; Karl F. Doerner; Richard F. Hartl; Martin W. P. Savelsbergh (Eur. J. Oper. Res., 2010)

An Automated Intensity-Modulated Radiation Therapy Planning System. - Shabbir Ahmed 001; Ozan Gozbasi; Martin W. P. Savelsbergh; Ian Crocker; Tim Fox; Eduard Schreibmann (INFORMS J. Comput., 2010)

Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem. - Mike Hewitt; George L. Nemhauser; Martin W. P. Savelsbergh (INFORMS J. Comput., 2010)

The Vehicle Routing Problem with Stochastic Demand and Duration Constraints. - Alan L. Erera; Juan Carlos Morales; Martin W. P. Savelsbergh (Transp. Sci., 2010)

Tactical and Operational Planning of Scheduled Maintenance for Per-Seat, On-Demand Air Transportation. - Gizem Keysan; George L. Nemhauser; Martin W. P. Savelsbergh (Transp. Sci., 2010)

Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem. - Faramroze G. Engineer; George L. Nemhauser; Martin W. P. Savelsbergh (INFORMS J. Comput., 2011)

Time Slot Management in Attended Home Delivery. - Niels A. H. Agatz; Ann Melissa Campbell; Moritz Fleischmann; Martin W. P. Savelsbergh (Transp. Sci., 2011)

Lane-Exchange Mechanisms for Truckload Carrier Collaboration. - Okan Örsan Özener; Özlem Ergun; Martin W. P. Savelsbergh (Transp. Sci., 2011)

Branch-and-Price Guided Search - (Extended Abstract). - Mike Hewitt; George L. Nemhauser; Martin W. P. Savelsbergh (ISCO, 2012)

Truck driver scheduling in Australia. - Asvin Goel; Claudia Archetti; Martin W. P. Savelsbergh (Comput. Oper. Res., 2012)

Pricing for production and delivery flexibility in single-item lot-sizing. - Yaxian Li; George L. Nemhauser; Martin W. P. Savelsbergh (Comput. Oper. Res., 2012)

A stockyard planning problem. - Natashia Boland; Damon Gulczynski; Martin W. P. Savelsbergh (EURO J. Transp. Logist., 2012)

Optimization for dynamic ride-sharing: A review. - Niels A. H. Agatz; Alan L. Erera; Martin W. P. Savelsbergh; Xing Wang (Eur. J. Oper. Res., 2012)

The Fixed-Charge Shortest-Path Problem. - Faramroze G. Engineer; George L. Nemhauser; Martin W. P. Savelsbergh; Jin-Hwa Song (INFORMS J. Comput., 2012)

A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing. - Faramroze G. Engineer; Kevin C. Furman; George L. Nemhauser; Martin W. P. Savelsbergh; Jin-Hwa Song (Oper. Res., 2012)

Fixed-Charge Transportation with Product Blending. - Dimitri J. Papageorgiou; Alejandro Toriello; George L. Nemhauser; Martin W. P. Savelsbergh (Transp. Sci., 2012)

Balancing fleet size and repositioning costs in LTL trucking. - José Antonio Carbajal; Alan L. Erera; Martin W. P. Savelsbergh (Ann. Oper. Res., 2013)

Creating schedules and computing operating costs for LTL load plans. - Alan L. Erera; Michael Hewitt; Martin W. P. Savelsbergh; Yang Zhang 005 (Comput. Oper. Res., 2013)

A branch-and-price guided search approach to maritime inventory routing. - Mike Hewitt; George L. Nemhauser; Martin W. P. Savelsbergh; Jin-Hwa Song (Comput. Oper. Res., 2013)

Restrict-and-relax search for 0-1 mixed-integer programs. - Menal Guzelsoy; George L. Nemhauser; Martin W. P. Savelsbergh (EURO J. Comput. Optim., 2013)

A pickup and delivery problem using crossdocks and truckload lane rates. - Kathleen Lindsey; Alan L. Erera; Martin W. P. Savelsbergh (EURO J. Transp. Logist., 2013)

Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem. - Mike Hewitt; George L. Nemhauser; Martin W. P. Savelsbergh (INFORMS J. Comput., 2013)

Allocating Cost of Service to Customers in Inventory Routing. - Okan Örsan Özener; Özlem Ergun; Martin W. P. Savelsbergh (Oper. Res., 2013)

Improved Load Plan Design Through Integer Programming Based Local Search. - Alan L. Erera; Michael Hewitt; Martin W. P. Savelsbergh; Yang Zhang 005 (Transp. Sci., 2013)

Local Search for a Cargo Assembly Planning Problem. - Gleb Belov; Natashia Boland; Martin W. P. Savelsbergh; Peter J. Stuckey (CPAIOR, 2014)

The Triangle Splitting Method for Biobjective Mixed Integer Programming. - Natashia Boland; Hadi Charkhgard; Martin W. P. Savelsbergh (IPCO, 2014)

Reclaimer Scheduling: Complexity and Algorithms. - Enrico Angelelli; Thomas Kalinowski; Reena Kapoor; Martin W. P. Savelsbergh (CoRR, 2014)

Carbon-aware transport and logistics. - Saif Benjaafar; Martin W. P. Savelsbergh (EURO J. Transp. Logist., 2014)

Incremental network design with shortest paths. - Matthew Baxter; Tarek Elgindy; Andreas T. Ernst; Thomas Kalinowski; Martin W. P. Savelsbergh (Eur. J. Oper. Res., 2014)

Pricing to accelerate demand learning in dynamic assortment planning for perishable products. - Masoud Talebian; Natashia Boland; Martin W. P. Savelsbergh (Eur. J. Oper. Res., 2014)

Boosting the feasibility pump. - Natashia L. Boland; Andrew C. Eberhard; Faramroze G. Engineer; Matteo Fischetti; Martin W. P. Savelsbergh; Angelos Tsoukalas (Math. Program. Comput., 2014)

A note on shortest path problems with forbidden paths. - Olivia J. Smith; Martin W. P. Savelsbergh (Networks, 2014)

A decision support tool for generating shipping data for the Hunter Valley coal chain. - Natashia Boland; Martin W. P. Savelsbergh; Hamish Waterer (Comput. Oper. Res., 2015)

Cargo assembly planning. - Martin W. P. Savelsbergh; Olivia J. Smith (EURO J. Transp. Logist., 2015)

Possession assessment and capacity evaluation of the Central Queensland Coal Network. - Martin W. P. Savelsbergh; Hamish Waterer; Matthew Dall; Chad Moffiet (EURO J. Transp. Logist., 2015)

Incremental network design with maximum flows. - Thomas Kalinowski; Dmytro Matsypura; Martin W. P. Savelsbergh (Eur. J. Oper. Res., 2015)

A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method. - Natashia Boland; Hadi Charkhgard; Martin W. P. Savelsbergh (INFORMS J. Comput., 2015)

A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method. - Natashia Boland; Hadi Charkhgard; Martin W. P. Savelsbergh (INFORMS J. Comput., 2015)

Editorial Statement. - Martin W. P. Savelsbergh (Transp. Sci., 2015)

The Vehicle Routing Problem with Occasional Drivers. - Claudia Archetti; Martin W. P. Savelsbergh; M. Grazia Speranza (Eur. J. Oper. Res., 2016)

The bi-objective mixed capacitated general routing problem with different route balance criteria. - Elin E. Halvorsen-Weare; Martin W. P. Savelsbergh (Eur. J. Oper. Res., 2016)

Proximity Benders: a decomposition heuristic for stochastic programs. - Natashia Boland; Matteo Fischetti; Michele Monaci; Martin W. P. Savelsbergh (J. Heuristics, 2016)

The L-shape search method for triobjective integer programming. - Natashia Boland; Hadi Charkhgard; Martin W. P. Savelsbergh (Math. Program. Comput., 2016)

A reclaimer scheduling problem arising in coal stockyard management. - Enrico Angelelli; Thomas Kalinowski; Reena Kapoor; Martin W. P. Savelsbergh (J. Sched., 2016)

Improved Integer Programming-Based Neighborhood Search for Less-Than-Truckload Load Plan Design. - Kathleen Lindsey; Alan L. Erera; Martin W. P. Savelsbergh (Transp. Sci., 2016)

Editorial - A Major Milestone: Transportation Science Turns Fifty. - Martin W. P. Savelsbergh (Transp. Sci., 2016)

50th Anniversary Invited Article - City Logistics: Challenges and Opportunities. - Martin W. P. Savelsbergh; Tom Van Woensel (Transp. Sci., 2016)

Solving the Traveling Salesman Problem with Time Windows Through Dynamically Generated Time-Expanded Networks. - Natashia Boland; Mike Hewitt; Duc Minh Vu; Martin W. P. Savelsbergh (CPAIOR, 2017)

An extended demand responsive connector. - Alan Lee; Martin W. P. Savelsbergh (EURO J. Transp. Logist., 2017)

The Quadrant Shrinking Method: A simple and efficient algorithm for solving tri-objective integer programs. - Natashia Boland; Hadi Charkhgard; Martin W. P. Savelsbergh (Eur. J. Oper. Res., 2017)

A new method for optimizing a linear function over the efficient set of a multiobjective integer program. - Natashia Boland; Hadi Charkhgard; Martin W. P. Savelsbergh (Eur. J. Oper. Res., 2017)

The generalized independent set problem: Polyhedral analysis and solution approaches. - Marco Colombi; Renata Mansini; Martin W. P. Savelsbergh (Eur. J. Oper. Res., 2017)

Adaptive Kernel Search: A heuristic for solving Mixed Integer linear Programs. - Gianfranco Guastaroba; Martin W. P. Savelsbergh; Maria Grazia Speranza (Eur. J. Oper. Res., 2017)

The Continuous-Time Service Network Design Problem. - Natashia Boland; Mike Hewitt; Luke Marshall; Martin W. P. Savelsbergh (Oper. Res., 2017)

Incremental Network Design with Minimum Spanning Trees. - Konrad Engel; Thomas Kalinowski; Martin W. P. Savelsbergh (J. Graph Algorithms Appl., 2017)

Scheduling reclaimers serving a stock pad at a coal terminal. - Thomas Kalinowski; Reena Kapoor; Martin W. P. Savelsbergh (J. Sched., 2017)

Dealing with Demand Uncertainty in Service Network and Load Plan Design. - Ahmad Baubaid; Natashia Boland; Martin W. P. Savelsbergh (CPAIOR, 2018)

A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem. - Edward He 001; Natashia Boland; George L. Nemhauser; Martin W. P. Savelsbergh (CPAIOR, 2018)

Nondominated Nash points: application of biobjective mixed integer programming. - Hadi Charkhgard; Martin W. P. Savelsbergh; Masoud Talebian (4OR, 2018)

A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints. - Hadi Charkhgard; Martin W. P. Savelsbergh; Masoud Talebian (Comput. Oper. Res., 2018)

Enhancing urban mobility: Integrating ride-sharing and public transit. - Mitja Stiglic; Niels A. H. Agatz; Martin W. P. Savelsbergh; Mirko Gradisar (Comput. Oper. Res., 2018)

Maximising Throughput in a Complex Coal Export System. - Mateus Rocha de Paula; Natashia Boland; Andreas T. Ernst; Alexandre Mendes; Martin W. P. Savelsbergh (CoRR, 2018)

Complexity of routing problems with release dates and deadlines. - Damián Reyes; Alan L. Erera; Martin W. P. Savelsbergh (Eur. J. Oper. Res., 2018)

Stochastic Inventory Routing for Perishable Products. - Yves Crama; Mahmood Rezaei; Martin W. P. Savelsbergh; Tom Van Woensel (Transp. Sci., 2018)

Throughput optimisation in a coal export system with multiple terminals and shared resources. - Mateus Rocha de Paula; Natashia Boland; Andreas T. Ernst; Alexandre Mendes; Martin W. P. Savelsbergh (Comput. Ind. Eng., 2019)

The price of discretizing time: a study in service network design. - Natashia Boland; Mike Hewitt; Luke Marshall; Martin W. P. Savelsbergh (EURO J. Transp. Logist., 2019)

Cost allocation under competition: a new rail access charging policy. - Martin W. P. Savelsbergh; Masoud Talebian (EURO J. Transp. Logist., 2019)

Preprocessing and cut generation techniques for multi-objective binary programming. - Natashia Boland; Hadi Charkhgard; Martin W. P. Savelsbergh (Eur. J. Oper. Res., 2019)

Biased-randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility. - Alejandro Estrada-Moreno; Martin W. P. Savelsbergh; Angel A. Juan; Javier Panadero (Int. Trans. Oper. Res., 2019)

Provably High-Quality Solutions for the Meal Delivery Routing Problem. - Baris Yildiz 001; Martin W. P. Savelsbergh (Transp. Sci., 2019)

Logistics optimization for a coal supply chain. - Gleb Belov; Natashia L. Boland; Martin W. P. Savelsbergh; Peter J. Stuckey (J. Heuristics, 2020)

A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method. - Tyler A. Perini; Natashia Boland; Diego Pecin; Martin W. P. Savelsbergh (INFORMS J. Comput., 2020)

Delivery systems with crowd-sourced drivers: A pickup and delivery problem with transfers. - Afonso H. Sampaio; Martin W. P. Savelsbergh; Lucas P. Veelenturf; Tom Van Woensel (Networks, 2020)

A Column Generation-Based Heuristic for the Split Delivery Vehicle Routing Problem with Time Windows. - Pedro Munari; Martin W. P. Savelsbergh (Oper. Res. Forum, 2020)

Same-Day Delivery with Drone Resupply. - Iman Dayarian; Martin W. P. Savelsbergh; John-Paul Clarke (Transp. Sci., 2020)

The Continuous-Time Inventory-Routing Problem. - Felipe Lagos; Natashia Boland; Martin W. P. Savelsbergh (Transp. Sci., 2020)

Workforce Scheduling in the Era of Crowdsourced Delivery. - Marlin W. Ulmer; Martin W. P. Savelsbergh (Transp. Sci., 2020)

Dynamic Discretization Discovery for Solving the Time-Dependent Traveling Salesman Problem with Time Windows. - Duc Minh Vu; Mike Hewitt; Natashia Boland; Martin W. P. Savelsbergh (Transp. Sci., 2020)

The vehicle routing problem with heterogeneous locker boxes. - Jasmin Grabenschweiger; Karl F. Doerner; Richard F. Hartl; Martin W. P. Savelsbergh (Central Eur. J. Oper. Res., 2021)

System optimal routing of traffic flows with user constraints using linear programming. - Enrico Angelelli; Valentina Morandi; Martin W. P. Savelsbergh; Maria Grazia Speranza (Eur. J. Oper. Res., 2021)

Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting. - Edward He 001; Natashia Boland; George L. Nemhauser; Martin W. P. Savelsbergh (INFORMS J. Comput., 2021)

Multivariable Branching: A 0-1 Knapsack Problem Case Study. - Yu Yang 014; Natashia Boland; Martin W. P. Savelsbergh (INFORMS J. Comput., 2021)

The Value of Limited Flexibility in Service Network Designs. - Ahmad Baubaid; Natashia Boland; Martin W. P. Savelsbergh (Transp. Sci., 2021)

Interval-Based Dynamic Discretization Discovery for Solving the Continuous-Time Service Network Design Problem. - Luke Marshall; Natashia Boland; Martin W. P. Savelsbergh; Mike Hewitt (Transp. Sci., 2021)

Thank You and Goodbye. - Martin W. P. Savelsbergh (Transp. Sci., 2021)

Challenges and opportunities in crowdsourced delivery planning and operations. - Martin W. P. Savelsbergh; Marlin W. Ulmer (4OR, 2022)

Dynamic discretization discovery for solving the Continuous Time Inventory Routing Problem with Out-and-Back Routes. - Felipe Lagos; Natashia Boland; Martin W. P. Savelsbergh (Comput. Oper. Res., 2022)

Optimizing package express operations in China. - Baris Yildiz 001; Martin W. P. Savelsbergh (Eur. J. Oper. Res., 2022)

Near real-time loadplan adjustments for less-than-truckload carriers. - Ian Herszterg; Yassine Ridouane; Natashia Boland; Alan L. Erera; Martin W. P. Savelsbergh (Eur. J. Oper. Res., 2022)

Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems. - Yu Yang 014; Natashia Boland; Bistra Dilkina; Martin W. P. Savelsbergh (Eur. J. Oper. Res., 2022)

Substitution-based equipment balancing in service networks with multiple equipment types. - Yu Yang 014; Yassine Ridouane; Natashia Boland; Alan L. Erera; Martin W. P. Savelsbergh (Eur. J. Oper. Res., 2022)

Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems. - Edward Yuhang He; Natashia Boland; George L. Nemhauser; Martin W. P. Savelsbergh (INFORMS J. Comput., 2022)

Decomposition Branching for Mixed Integer Programming. - Baris Yildiz 001; Natashia Boland; Martin W. P. Savelsbergh (Oper. Res., 2022)

An exact algorithm for the service network design problem with hub capacity constraints. - Edward He 001; Natashia Boland; George L. Nemhauser; Martin W. P. Savelsbergh (Networks, 2022)

Dynamic service area sizing in urban delivery. - Marlin W. Ulmer; Alan L. Erera; Martin W. P. Savelsbergh (OR Spectr., 2022)

Compact Formulations for Split Delivery Routing Problems. - Pedro Munari; Martin W. P. Savelsbergh (Transp. Sci., 2022)

Multi-Period Workload Balancing in Last-Mile Urban Delivery. - Yang Wang 200; Lei Zhao 009; Martin W. P. Savelsbergh; Shengnan Wu (Transp. Sci., 2022)

Transshipment network design for express air cargo operations in China. - Baris Yildiz 001; Martin W. P. Savelsbergh; Ali K. Dogru (EURO J. Transp. Logist., 2023)

Service Network Design for Same-Day Delivery with Hub Capacity Constraints. - Haotian Wu; Ian Herszterg; Martin W. P. Savelsbergh; Yixiao Huang 001 (Transp. Sci., 2023)

The Dynamic Freight Routing Problem for Less-Than-Truckload Carriers. - Ahmad Baubaid; Natashia Boland; Martin W. P. Savelsbergh (Transp. Sci., 2023)

A Prescriptive Machine Learning Method for Courier Scheduling on Crowdsourced Delivery Platforms. - Adam Behrendt; Martin W. P. Savelsbergh; He Wang 009 (Transp. Sci., 2023)

Capacity requirements and demand management strategies in meal delivery. - Ramon Auad; Alan L. Erera; Martin W. P. Savelsbergh (EURO J. Transp. Logist., 2024)

Dynamic Courier Capacity Acquisition in Rapid Delivery Systems: A Deep Q-Learning Approach. - Ramon Auad; Alan L. Erera; Martin W. P. Savelsbergh (Transp. Sci., 2024)

A fast and robust algorithm for solving biobjective mixed integer programs. - Diego Pecin; Ian Herszterg; Tyler A. Perini; Natashia Boland; Martin W. P. Savelsbergh (Math. Methods Oper. Res., 2024)

Challenges and opportunities in crowdsourced delivery planning and operations - an update. - Martin W. P. Savelsbergh; Marlin W. Ulmer (Ann. Oper. Res., 2024)