default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin W. P. Savelsbergh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j165]Diego Pecin, Ian Herszterg, Tyler A. Perini
, Natashia Boland, Martin W. P. Savelsbergh:
A fast and robust algorithm for solving biobjective mixed integer programs. Math. Methods Oper. Res. 100(1): 221-262 (2024)- [j164]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): 67-93 (2024) - 2023
- [j163]Baris Yildiz, Martin W. P. Savelsbergh, Ali K. Dogru:
Transshipment network design for express air cargo operations in China. EURO J. Transp. Logist. 12: 100120 (2023) - [j162]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): 273-287 (2023) - [j161]Ahmad Baubaid, Natashia Boland, Martin W. P. Savelsbergh:
The Dynamic Freight Routing Problem for Less-Than-Truckload Carriers. Transp. Sci. 57(3): 717-740 (2023) - [j160]Adam Behrendt, Martin W. P. Savelsbergh, He Wang:
A Prescriptive Machine Learning Method for Courier Scheduling on Crowdsourced Delivery Platforms. Transp. Sci. 57(4): 889-907 (2023) - 2022
- [j159]Martin W. P. Savelsbergh, Marlin W. Ulmer:
Challenges and opportunities in crowdsourced delivery planning and operations. 4OR 20(1): 1-21 (2022) - [j158]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: 105686 (2022) - [j157]Baris Yildiz, Martin W. P. Savelsbergh:
Optimizing package express operations in China. Eur. J. Oper. Res. 300(1): 320-335 (2022) - [j156]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): 966-978 (2022) - [j155]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): 828-840 (2022) - [j154]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): 1021-1034 (2022) - [j153]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): 1086-1114 (2022) - [j152]Baris Yildiz, Natashia Boland, Martin W. P. Savelsbergh:
Decomposition Branching for Mixed Integer Programming. Oper. Res. 70(3): 1854-1872 (2022) - [j151]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): 572-596 (2022) - [j150]Marlin W. Ulmer, Alan L. Erera, Martin W. P. Savelsbergh:
Dynamic service area sizing in urban delivery. OR Spectr. 44(3): 763-793 (2022) - [j149]Pedro Munari, Martin W. P. Savelsbergh:
Compact Formulations for Split Delivery Routing Problems. Transp. Sci. 56(4): 1022-1043 (2022) - [j148]Yang Wang, Lei Zhao, Martin W. P. Savelsbergh, Shengnan Wu:
Multi-Period Workload Balancing in Last-Mile Urban Delivery. Transp. Sci. 56(5): 1348-1368 (2022) - 2021
- [j147]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): 113-142 (2021) - [j146]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): 863-879 (2021) - [j145]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): 997-1014 (2021) - [j144]Yu Yang, Natashia Boland, Martin W. P. Savelsbergh:
Multivariable Branching: A 0-1 Knapsack Problem Case Study. INFORMS J. Comput. 33(4): 1354-1367 (2021) - [j143]Martin W. P. Savelsbergh:
Thank You and Goodbye. Transp. Sci. 55(1): 1 (2021) - [j142]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): 29-51 (2021) - [j141]Ahmad Baubaid, Natashia Boland, Martin W. P. Savelsbergh:
The Value of Limited Flexibility in Service Network Designs. Transp. Sci. 55(1): 52-74 (2021) - 2020
- [j140]Gleb Belov, Natashia L. Boland, Martin W. P. Savelsbergh, Peter J. Stuckey:
Logistics optimization for a coal supply chain. J. Heuristics 26(2): 269-300 (2020) - [j139]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): 16-39 (2020) - [j138]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): 232-255 (2020) - [j137]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) - [j136]Iman Dayarian, Martin W. P. Savelsbergh, John-Paul Clarke:
Same-Day Delivery with Drone Resupply. Transp. Sci. 54(1): 229-249 (2020) - [j135]Felipe Lagos, Natashia Boland, Martin W. P. Savelsbergh:
The Continuous-Time Inventory-Routing Problem. Transp. Sci. 54(2): 375-399 (2020) - [j134]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): 703-720 (2020) - [j133]Marlin W. Ulmer, Martin W. P. Savelsbergh:
Workforce Scheduling in the Era of Crowdsourced Delivery. Transp. Sci. 54(4): 1113-1133 (2020)
2010 – 2019
- 2019
- [j132]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: 37-51 (2019) - [j131]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): 195-216 (2019) - [j130]Martin W. P. Savelsbergh, Masoud Talebian:
Cost allocation under competition: a new rail access charging policy. EURO J. Transp. Logist. 8(5): 511-534 (2019) - [j129]Natashia Boland, Hadi Charkhgard, Martin W. P. Savelsbergh:
Preprocessing and cut generation techniques for multi-objective binary programming. Eur. J. Oper. Res. 274(3): 858-875 (2019) - [j128]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): 1293-1314 (2019) - [j127]Baris Yildiz, Martin W. P. Savelsbergh:
Provably High-Quality Solutions for the Meal Delivery Routing Problem. Transp. Sci. 53(5): 1372-1388 (2019) - 2018
- [j126]Hadi Charkhgard, Martin W. P. Savelsbergh, Masoud Talebian:
Nondominated Nash points: application of biobjective mixed integer programming. 4OR 16(2): 151-171 (2018) - [j125]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: 17-30 (2018) - [j124]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: 12-21 (2018) - [j123]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): 29-34 (2018) - [j122]Yves Crama, Mahmood Rezaei, Martin W. P. Savelsbergh, Tom Van Woensel:
Stochastic Inventory Routing for Perishable Products. Transp. Sci. 52(3): 526-546 (2018) - [c11]Ahmad Baubaid, Natashia Boland, Martin W. P. Savelsbergh:
Dealing with Demand Uncertainty in Service Network and Load Plan Design. CPAIOR 2018: 63-71 - [c10]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: 289-297 - [i5]Mateus Rocha de Paula, Natashia Boland, Andreas T. Ernst, Alexandre Mendes, Martin W. P. Savelsbergh:
Maximising Throughput in a Complex Coal Export System. CoRR abs/1808.06044 (2018) - 2017
- [j121]Alan Lee, Martin W. P. Savelsbergh:
An extended demand responsive connector. EURO J. Transp. Logist. 6(1): 25-50 (2017) - [j120]Marco Colombi, Renata Mansini, Martin W. P. Savelsbergh:
The generalized independent set problem: Polyhedral analysis and solution approaches. Eur. J. Oper. Res. 260(1): 41-55 (2017) - [j119]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): 873-885 (2017) - [j118]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): 904-919 (2017) - [j117]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): 789-804 (2017) - [j116]Natashia Boland, Mike Hewitt, Luke Marshall, Martin W. P. Savelsbergh:
The Continuous-Time Service Network Design Problem. Oper. Res. 65(5): 1303-1321 (2017) - [j115]Konrad Engel, Thomas Kalinowski, Martin W. P. Savelsbergh:
Incremental Network Design with Minimum Spanning Trees. J. Graph Algorithms Appl. 21(4): 417-432 (2017) - [j114]Thomas Kalinowski, Reena Kapoor, Martin W. P. Savelsbergh:
Scheduling reclaimers serving a stock pad at a coal terminal. J. Sched. 20(1): 85-101 (2017) - [c9]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: 254-262 - 2016
- [j113]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): 451-465 (2016) - [j112]Claudia Archetti, Martin W. P. Savelsbergh, M. Grazia Speranza:
The Vehicle Routing Problem with Occasional Drivers. Eur. J. Oper. Res. 254(2): 472-480 (2016) - [j111]Natashia Boland, Matteo Fischetti, Michele Monaci, Martin W. P. Savelsbergh:
Proximity Benders: a decomposition heuristic for stochastic programs. J. Heuristics 22(2): 181-198 (2016) - [j110]Natashia Boland, Hadi Charkhgard, Martin W. P. Savelsbergh:
The L-shape search method for triobjective integer programming. Math. Program. Comput. 8(2): 217-251 (2016) - [j109]Enrico Angelelli, Thomas Kalinowski, Reena Kapoor, Martin W. P. Savelsbergh:
A reclaimer scheduling problem arising in coal stockyard management. J. Sched. 19(5): 563-582 (2016) - [j108]Martin W. P. Savelsbergh:
Editorial - A Major Milestone: Transportation Science Turns Fifty. Transp. Sci. 50(1): 1-2 (2016) - [j107]Martin W. P. Savelsbergh, Tom Van Woensel:
50th Anniversary Invited Article - City Logistics: Challenges and Opportunities. Transp. Sci. 50(2): 579-590 (2016) - [j106]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): 1360-1379 (2016) - 2015
- [j105]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: 54-67 (2015) - [j104]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): 139-173 (2015) - [j103]Martin W. P. Savelsbergh, Olivia J. Smith:
Cargo assembly planning. EURO J. Transp. Logist. 4(3): 321-354 (2015) - [j102]Thomas Kalinowski, Dmytro Matsypura, Martin W. P. Savelsbergh:
Incremental network design with maximum flows. Eur. J. Oper. Res. 242(1): 51-62 (2015) - [j101]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): 597-618 (2015) - [j100]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): 735-754 (2015) - [j99]Martin W. P. Savelsbergh:
Editorial Statement. Transp. Sci. 49(2): 163-164 (2015) - 2014
- [j98]Saif Benjaafar, Martin W. P. Savelsbergh:
Carbon-aware transport and logistics. EURO J. Transp. Logist. 3(1): 1-3 (2014) - [j97]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): 555-565 (2014) - [j96]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): 675-684 (2014) - [j95]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): 255-279 (2014) - [j94]Olivia J. Smith, Martin W. P. Savelsbergh:
A note on shortest path problems with forbidden paths. Networks 63(3): 239-242 (2014) - [c8]Gleb Belov, Natashia Boland, Martin W. P. Savelsbergh, Peter J. Stuckey:
Local Search for a Cargo Assembly Planning Problem. CPAIOR 2014: 159-175 - [c7]Natashia Boland, Hadi Charkhgard, Martin W. P. Savelsbergh:
The Triangle Splitting Method for Biobjective Mixed Integer Programming. IPCO 2014: 162-173 - [i4]Enrico Angelelli, Thomas Kalinowski, Reena Kapoor, Martin W. P. Savelsbergh:
Reclaimer Scheduling: Complexity and Algorithms. CoRR abs/1402.4178 (2014) - 2013
- [j93]José Antonio Carbajal, Alan L. Erera, Martin W. P. Savelsbergh:
Balancing fleet size and repositioning costs in LTL trucking. Ann. Oper. Res. 203(1): 235-254 (2013) - [j92]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): 691-702 (2013) - [j91]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): 1410-1419 (2013) - [j90]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): 201-218 (2013) - [j89]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): 5-27 (2013) - [j88]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): 302-316 (2013) - [j87]Okan Örsan Özener, Özlem Ergun, Martin W. P. Savelsbergh:
Allocating Cost of Service to Customers in Inventory Routing. Oper. Res. 61(1): 112-125 (2013) - [j86]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): 412-427 (2013) - [i3]Konrad Engel, Thomas Kalinowski, Martin W. P. Savelsbergh:
Incremental Network Design with Minimum Spanning Trees. CoRR abs/1306.1926 (2013) - [i2]Thomas Kalinowski, Dmytro Matsypura, Martin W. P. Savelsbergh:
Incremental Network Design with Maximum Flows. CoRR abs/1312.6447 (2013) - 2012
- [j85]Asvin Goel, Claudia Archetti, Martin W. P. Savelsbergh:
Truck driver scheduling in Australia. Comput. Oper. Res. 39(5): 1122-1132 (2012) - [j84]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): 3408-3419 (2012) - [j83]Natashia Boland, Damon Gulczynski, Martin W. P. Savelsbergh:
A stockyard planning problem. EURO J. Transp. Logist. 1(3): 197-236 (2012) - [j82]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): 295-303 (2012) - [j81]Faramroze G. Engineer, George L. Nemhauser, Martin W. P. Savelsbergh, Jin-Hwa Song:
The Fixed-Charge Shortest-Path Problem. INFORMS J. Comput. 24(4): 578-596 (2012) - [j80]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): 106-122 (2012) - [j79]Dimitri J. Papageorgiou, Alejandro Toriello, George L. Nemhauser, Martin W. P. Savelsbergh:
Fixed-Charge Transportation with Product Blending. Transp. Sci. 46(2): 281-295 (2012) - [c6]Mike Hewitt, George L. Nemhauser, Martin W. P. Savelsbergh:
Branch-and-Price Guided Search - (Extended Abstract). ISCO 2012: 15-18 - 2011
- [j78]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): 105-119 (2011) - [j77]Okan Örsan Özener, Özlem Ergun, Martin W. P. Savelsbergh:
Lane-Exchange Mechanisms for Truckload Carrier Collaboration. Transp. Sci. 45(1): 1-17 (2011) - [j76]Niels A. H. Agatz, Ann Melissa Campbell, Moritz Fleischmann, Martin W. P. Savelsbergh:
Time Slot Management in Attended Home Delivery. Transp. Sci. 45(3): 435-449 (2011) - 2010
- [j75]Vera C. Hemmelmayr, Karl F. Doerner, Richard F. Hartl, Martin W. P. Savelsbergh:
Vendor managed inventory for environments with stochastic product usage. Eur. J. Oper. Res. 202(3): 686-695 (2010) - [j74]Mike Hewitt, George L. Nemhauser, Martin W. P. Savelsbergh:
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem. INFORMS J. Comput. 22(2): 314-325 (2010) - [j73]Shabbir Ahmed, Ozan Gozbasi, Martin W. P. Savelsbergh, Ian Crocker, Tim Fox, Eduard Schreibmann:
An Automated Intensity-Modulated Radiation Therapy Planning System. INFORMS J. Comput. 22(4): 568-583 (2010) - [j72]Gizem Keysan, George L. Nemhauser, Martin W. P. Savelsbergh:
Tactical and Operational Planning of Scheduled Maintenance for Per-Seat, On-Demand Air Transportation. Transp. Sci. 44(3): 291-306 (2010) - [j71]Alan L. Erera, Juan Carlos Morales, Martin W. P. Savelsbergh:
The Vehicle Routing Problem with Stochastic Demand and Duration Constraints. Transp. Sci. 44(4): 474-492 (2010)
2000 – 2009
- 2009
- [j70]Alan L. Erera, Juan Carlos Morales, Martin W. P. Savelsbergh:
Robust Optimization for Empty Repositioning Problems. Oper. Res. 57(2): 468-483 (2009) - [j69]Fatma Kilinç-Karzan, George L. Nemhauser, Martin W. P. Savelsbergh:
Information-based branching schemes for binary linear mixed integer problems. Math. Program. Comput. 1(4): 249-293 (2009) - [j68]Alan L. Erera, Martin W. P. Savelsbergh:
ROUTE 2007: Recent advances in vehicle routing optimization. Networks 54(4): 165-166 (2009) - [j67]Alan L. Erera, Martin W. P. Savelsbergh, Emrah Uyar:
Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints. Networks 54(4): 270-283 (2009) - [j66]Fatma Kilinç-Karzan, Alejandro Toriello, Shabbir Ahmed, George L. Nemhauser, Martin W. P. Savelsbergh:
Approximating the stability region for binary mixed-integer programs. Oper. Res. Lett. 37(4): 250-254 (2009) - [j65]Vera C. Hemmelmayr, Karl F. Doerner, Richard F. Hartl, Martin W. P. Savelsbergh:
Delivery strategies for blood products supplies. OR Spectr. 31(4): 707-725 (2009) - [j64]Verena Schmid, Karl F. Doerner, Richard F. Hartl, Martin W. P. Savelsbergh, Wolfgang Stoecher:
A Hybrid Solution Approach for Ready-Mixed Concrete Delivery. Transp. Sci. 43(1): 70-85 (2009) - [j63]Claudia Archetti, Martin W. P. Savelsbergh:
The Trip Scheduling Problem. Transp. Sci. 43(4): 417-431 (2009) - [r1]Martin W. P. Savelsbergh:
Branch and Price: Integer Programming with Column Generation. Encyclopedia of Optimization 2009: 328-332 - [i1]George L. Nemhauser, Mike Hewitt, Martin W. P. Savelsbergh:
Using Branch-and-Price to Find High Quality Solutions Quickly. Models and Algorithms for Optimization in Logistics 2009 - 2008
- [j62]Martin W. P. Savelsbergh, Jin-Hwa Song:
An optimization algorithm for the inventory routing problem with continuous moves. Comput. Oper. Res. 35(7): 2266-2282 (2008) - [j61]Alan L. Erera, Burak Karacik, Martin W. P. Savelsbergh:
A dynamic driver management scheme for less-than-truckload carriers. Comput. Oper. Res. 35(11): 3397-3411 (2008) - [j60]Jill R. Hardin, George L. Nemhauser, Martin W. P. Savelsbergh:
Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements. Discret. Optim. 5(1): 19-35 (2008) - [j59]Claudia Archetti, Maria Grazia Speranza, Martin W. P. Savelsbergh:
An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem. Transp. Sci. 42(1): 22-31 (2008) - [j58]Daniel G. Espinoza, Renan Garcia, Marcos Goycoolea, George L. Nemhauser, Martin W. P. Savelsbergh:
Per-Seat, On-Demand Air Transportation Part I: Problem Description and an Integer Multicommodity Flow Model. Transp. Sci. 42(3): 263-278 (2008) - [j57]Daniel G. Espinoza, Renan Garcia, Marcos Goycoolea, George L. Nemhauser, Martin W. P. Savelsbergh:
Per-Seat, On-Demand Air Transportation Part II: Parallel Local Search. Transp. Sci. 42(3): 279-291 (2008) - 2007
- [j56]Özlem Ergun, Gültekin Kuyzu, Martin W. P. Savelsbergh:
Shipper collaboration. Comput. Oper. Res. 34(6): 1551-1560 (2007) - [j55]Jill R. Hardin, George L. Nemhauser, Martin W. P. Savelsbergh:
Analysis of bounds for a capacitated single-item lot-sizing problem. Comput. Oper. Res. 34(6): 1721-1743 (2007) - [j54]Martin W. P. Savelsbergh, Jin-Hwa Song:
Inventory routing with continuous moves. Comput. Oper. Res. 34(6): 1744-1763 (2007) - [j53]Enrico Angelelli, Maria Grazia Speranza, Martin W. P. Savelsbergh:
Competitive analysis for dynamic multiperiod uncapacitated routing problems. Networks 49(4): 308-317 (2007) - [j52]Enrico Angelelli, Martin W. P. Savelsbergh, Maria Grazia Speranza:
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem. Oper. Res. Lett. 35(6): 713-721 (2007) - [j51]Jin-Hwa Song, Martin W. P. Savelsbergh:
Performance Measurement for Inventory Routing. Transp. Sci. 41(1): 44-54 (2007) - [j50]Özlem Ergun, Gültekin Kuyzu, Martin W. P. Savelsbergh:
Reducing Truckload Transportation Costs Through Collaboration. Transp. Sci. 41(2): 206-221 (2007) - [p3]Jean-François Cordeau, Gilbert Laporte, Martin W. P. Savelsbergh, Daniele Vigo:
Chapter 6 Vehicle Routing. Transportation 2007: 367-428 - [p2]Jean-François Cordeau, Gilbert Laporte, Jean-Yves Potvin, Martin W. P. Savelsbergh:
Chapter 7 Transportation on Demand. Transportation 2007: 429-466 - 2006
- [j49]François Vanderbeck, Martin W. P. Savelsbergh:
A generic view of Dantzig-Wolfe decomposition in mixed integer programming. Oper. Res. Lett. 34(3): 296-306 (2006) - [j48]Claudia Archetti, Martin W. P. Savelsbergh, Maria Grazia Speranza:
Worst-Case Analysis for Split Delivery Vehicle Routing Problems. Transp. Sci. 40(2): 226-234 (2006) - [j47]Ann Melissa Campbell, Martin W. P. Savelsbergh:
Incentive Schemes for Attended Home Delivery Services. Transp. Sci. 40(3): 327-341 (2006) - 2005
- [j46]Alper Atamtürk, Martin W. P. Savelsbergh:
Integer-Programming Software Systems. Ann. Oper. Res. 140(1): 67-124 (2005) - [j45]Martin W. P. Savelsbergh, R. N. Uma, Joel Wein:
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems. INFORMS J. Comput. 17(1): 123-136 (2005) - [j44]Iris F. A. Vis, René M. B. M. de Koster, Martin W. P. Savelsbergh:
Minimum Vehicle Fleet Size Under Time-Window Constraints at a Container Terminal. Transp. Sci. 39(2): 249-260 (2005) - [j43]Ann Melissa Campbell, Martin W. P. Savelsbergh:
Decision Support for Consumer Direct Grocery Initiatives. Transp. Sci. 39(3): 313-327 (2005) - 2004
- [j42]Anton J. Kleywegt, Vijay S. Nori, Martin W. P. Savelsbergh:
Dynamic Programming Approximations for a Stochastic Inventory Routing Problem. Transp. Sci. 38(1): 42-70 (2004) - [j41]Ann Melissa Campbell, Martin W. P. Savelsbergh:
Delivery Volume Optimization. Transp. Sci. 38(2): 210-223 (2004) - [j40]Ann Melissa Campbell, Martin W. P. Savelsbergh:
Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems. Transp. Sci. 38(3): 369-378 (2004) - [j39]Ann Melissa Campbell, Martin W. P. Savelsbergh:
A Decomposition Approach for the Inventory-Routing Problem. Transp. Sci. 38(4): 488-502 (2004) - 2003
- [j38]Stan P. M. van Hoesel, Arie M. C. A. Koster, Robert L. M. J. van de Leensel, Martin W. P. Savelsbergh:
Bidirected and unidirected capacity installation in telecommunication networks. Discret. Appl. Math. 133(1-3): 103-121 (2003) - [j37]Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh:
On the polyhedral structure of a multi-item production planning model with setup times. Math. Program. 94(2-3): 375-405 (2003) - [j36]Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh:
A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case. Math. Program. 95(1): 71-90 (2003) - [j35]Brady Hunsaker, Anton J. Kleywegt, Martin W. P. Savelsbergh, Craig A. Tovey:
Optimal Online Algorithms for Minimax Resource Scheduling. SIAM J. Discret. Math. 16(4): 555-590 (2003) - 2002
- [j34]Petra Bauer, Jeff T. Linderoth, Martin W. P. Savelsbergh:
A branch and cut approach to the cardinality constrained circuit problem. Math. Program. 91(2): 307-348 (2002) - [j33]Stan P. M. van Hoesel, Arie M. C. A. Koster, Robert L. M. J. van de Leensel, Martin W. P. Savelsbergh:
Polyhedral results for the edge capacity polytope. Math. Program. 92(2): 335-358 (2002) - [j32]Hamish Waterer, Ellis L. Johnson, Paolo Nobili, Martin W. P. Savelsbergh:
The relation of time indexed formulations of single machine scheduling problems to the node packing problem. Math. Program. 93(3): 477-494 (2002) - [j31]Brady Hunsaker, Martin W. P. Savelsbergh:
Efficient feasibility testing for dial-a-ride problems. Oper. Res. Lett. 30(3): 169-173 (2002) - [j30]Anton J. Kleywegt, Vijay S. Nori, Martin W. P. Savelsbergh:
The Stochastic Inventory Routing Problem with Direct Deliveries. Transp. Sci. 36(1): 94-118 (2002) - [p1]Ann M. Campbell, Lloyd W. Clarke, Martin W. P. Savelsbergh:
Inventory Routing in Practice. The Vehicle Routing Problem 2002: 309-330 - 2001
- [j29]Cristina C. B. Cavalcante, C. Carvalho de Souza, Martin W. P. Savelsbergh, Y. Wang, Laurence A. Wolsey:
Scheduling projects with labor constraints. Discret. Appl. Math. 112(1-3): 27-52 (2001) - [j28]Gail W. DePuy, Martin W. P. Savelsbergh, Jane C. Ammons, Leon F. McGinnis:
An Integer Programming Heuristic for Component Allocation in Printed Circuit Card Assembly Systems. J. Heuristics 7(4): 351-369 (2001) - [j27]Jeff T. Linderoth, Eva K. Lee, Martin W. P. Savelsbergh:
A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems. INFORMS J. Comput. 13(3): 191-209 (2001) - [j26]Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh:
Valid inequalities for problems with additive variable upper bounds. Math. Program. 91(1): 145-162 (2001) - [c5]Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh:
Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times. IPCO 2001: 318-332 - 2000
- [j25]Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh:
Conflict graphs in solving integer programming problems. Eur. J. Oper. Res. 121(1): 40-55 (2000) - [j24]Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh:
On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra. Eur. J. Oper. Res. 125(2): 298-315 (2000) - [j23]Ellis L. Johnson, George L. Nemhauser, Martin W. P. Savelsbergh:
Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition. INFORMS J. Comput. 12(1): 2-23 (2000) - [j22]Marjan van den Akker, Cor A. J. Hurkens, Martin W. P. Savelsbergh:
Time-Indexed Formulations for Machine Scheduling Problems: Column Generation. INFORMS J. Comput. 12(2): 111-124 (2000) - [j21]Alper Atamtürk, Ellis L. Johnson, Jeff T. Linderoth, Martin W. P. Savelsbergh:
A Relational Modeling System for Linear and Integer Programming. Oper. Res. 48(6): 846-857 (2000) - [j20]Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh:
Sequence Independent Lifting in Mixed Integer Programming. J. Comb. Optim. 4(1): 109-129 (2000) - [j19]Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh:
The mixed vertex packing problem. Math. Program. 89(1): 35-53 (2000)
1990 – 1999
- 1999
- [j18]Martin Desrochers, Christopher V. Jones, Jan Karel Lenstra, Martin W. P. Savelsbergh, Leen Stougie:
Towards a model and algorithm management system for vehicle routing and scheduling problems. Decis. Support Syst. 25(2): 109-133 (1999) - [j17]Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh:
Lifted Cover Inequalities for 0-1 Integer Programs: Complexity. INFORMS J. Comput. 11(1): 117-123 (1999) - [j16]Jeff T. Linderoth, Martin W. P. Savelsbergh:
A Computational Study of Search Strategies for Mixed Integer Programming. INFORMS J. Comput. 11(2): 173-187 (1999) - [j15]Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh:
Lifted flow cover inequalities for mixed 0-1 integer programs. Math. Program. 85(3): 439-467 (1999) - [j14]J. M. van den Akker, C. P. M. van Hoesel, Martin W. P. Savelsbergh:
A polyhedral approach to single-machine scheduling problems. Math. Program. 85(3): 541-572 (1999) - [c4]Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh:
Valid Inequalities for Problems with Additive Variable Upper Bounds. IPCO 1999: 60-72 - [c3]Anton J. Kleywegt, Vijay S. Nori, Martin W. P. Savelsbergh, Craig A. Tovey:
Online Resource Minimization. SODA 1999: 576-585 - 1998
- [j13]Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh:
Lifted Cover Inequalities for 0-1 Integer Programs: Computation. INFORMS J. Comput. 10(4): 427-437 (1998) - [j12]Cynthia Barnhart, Ellis L. Johnson, George L. Nemhauser, Martin W. P. Savelsbergh, Pamela H. Vance:
Branch-and-Price: Column Generation for Solving Huge Integer Programs. Oper. Res. 46(3): 316-329 (1998) - [j11]Martin W. P. Savelsbergh, Marc Sol:
Drive: Dynamic Routing of Independent Vehicles. Oper. Res. 46(4): 474-490 (1998) - [c2]Martin W. P. Savelsbergh, R. N. Uma, Joel Wein:
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems. SODA 1998: 453-462 - 1997
- [j10]Martin W. P. Savelsbergh:
A Branch-and-Price Algorithm for the Generalized Assignment Problem. Oper. Res. 45(6): 831-841 (1997) - 1996
- [j9]Marc Wennink, Martin W. P. Savelsbergh:
Towards a planning board generator. Decis. Support Syst. 17(3): 199-226 (1996) - [j8]Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh:
A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems. J. Heuristics 1(2): 247-259 (1996) - 1995
- [j7]Martin W. P. Savelsbergh, Marc Sol:
The General Pickup and Delivery Problem. Transp. Sci. 29(1): 17-29 (1995) - [c1]Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh:
Sequence Independent Lifting of Cover Inequalities. IPCO 1995: 452-461 - 1994
- [j6]Martin W. P. Savelsbergh:
Preprocessing and Probing Techniques for Mixed Integer Programming Problems. INFORMS J. Comput. 6(4): 445-454 (1994) - [j5]George L. Nemhauser, Martin W. P. Savelsbergh, Gabriele Sigismondi:
MINTO, a mixed INTeger optimizer. Oper. Res. Lett. 15(1): 47-58 (1994) - 1993
- [j4]Gerard A. P. Kindervater, Jan Karel Lenstra, Martin W. P. Savelsbergh:
Sequential and Parallel Local Search for the Time-Constrained Traveling Salesman Problem. Discret. Appl. Math. 42(2): 211-225 (1993) - 1992
- [j3]Martin W. P. Savelsbergh:
The Vehicle Routing Problem with Time Windows: Minimizing Route Duration. INFORMS J. Comput. 4(2): 146-154 (1992)
1980 – 1989
- 1988
- [j2]Jac M. Anthonisse, Jan Karel Lenstra, Martin W. P. Savelsbergh:
Behind the screen: DSS from an OR point of view. Decis. Support Syst. 4(4): 413-419 (1988) - 1985
- [j1]Martin W. P. Savelsbergh, Ton Volgenant:
Edge exchanges in the degree-constrained minimum spanning tree problem. Comput. Oper. Res. 12(4): 341-348 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
