2013 - Fellow of the Institute for Operations Research and the Management Sciences (INFORMS)
Mathematical optimization, Integer programming, Vehicle routing problem, Operations research and Routing are his primary areas of study. His research integrates issues of Algorithm and Scheduling in his study of Mathematical optimization. Martin W. P. Savelsbergh has included themes like Optimization problem, Theoretical computer science and Integer in his Integer programming study.
The concepts of his Vehicle routing problem study are interwoven with issues in Transport engineering, Cluster analysis, Travelling salesman problem, Heuristics and Heuristic. His work on Inventory theory as part of general Operations research study is frequently connected to Destination-Sequenced Distance Vector routing, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them. His research on Routing also deals with topics like
Martin W. P. Savelsbergh spends much of his time researching Mathematical optimization, Integer programming, Operations research, Vehicle routing problem and Routing. His Mathematical optimization study combines topics in areas such as Algorithm, Set and Integer. The Integer programming study which covers Heuristics that intersects with Heuristic.
His Operations research research is multidisciplinary, relying on both Vendor-managed inventory, Scheduling, Service and Operations management. His Scheduling research includes themes of Simulation and Approximation algorithm. His research in Vehicle routing problem intersects with topics in Travelling salesman problem and Transport engineering.
The scientist’s investigation covers issues in Mathematical optimization, Operations research, Vehicle routing problem, Integer programming and Routing. His Mathematical optimization study incorporates themes from Mathematical economics and Stochastic game. The various areas that he examines in his Operations research study include Dynamic programming, Order, Workforce scheduling and Inventory routing problem.
His work deals with themes such as Aeronautics and Benchmark, which intersect with Vehicle routing problem. His Integer programming research includes elements of Programming language and Integer. Within one scientific family, he focuses on topics pertaining to Heuristic under Routing, and may sometimes address concerns connected to Linear programming and Process.
Martin W. P. Savelsbergh spends much of his time researching Mathematical optimization, Operations research, Quality, Vehicle routing problem and Profit. His study ties his expertise on Service together with the subject of Mathematical optimization. His work carried out in the field of Operations research brings together such families of science as Computational complexity theory, Routing, Order and Dynamic decision-making.
Martin W. P. Savelsbergh has researched Quality in several fields, including Discount points, Computer network and Integer programming. The Vehicle routing problem study combines topics in areas such as Iterated local search and Aeronautics. His studies in Profit integrate themes in fields like Capacity planning, Marketing, Service level and Inventory routing problem.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Cynthia Barnhart;Ellis L. Johnson;George L. Nemhauser;Martin W. P. Savelsbergh.
Operations Research (1998)
The General Pickup and Delivery Problem
Martin W. P. Savelsbergh;Marc Sol.
(1995)
Optimization for dynamic ride-sharing: A review
Niels A. H. Agatz;Alan L. Erera;Martin W. P. Savelsbergh;Xing Wang.
(2012)
Local search in routing problems with time windows
M. W. P. Savelsbergh.
(1985)
Vehicle routing with time windows: Optimization and approximation
M. Desrochers;Jan Karel Lenstra;M.W.P. Savelsbergh;F. Soumis.
Stud. Management Sci. Systems (1988)
A Branch-and-Price Algorithm for the Generalized Assignment Problem
Martin W. P. Savelsbergh.
(1997)
Dynamic Ride-Sharing: a Simulation Study in Metro Atlanta
Niels A.H. Agatz;Alan L. Erera;Martin W.P. Savelsbergh;Xing Wang.
(2011)
The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
Martin W. P. Savelsbergh.
(1992)
Preprocessing and Probing Techniques for Mixed Integer Programming Problems
Martin W. P. Savelsbergh.
(1994)
A Computational Study of Search Strategies for Mixed Integer Programming
J. T. Linderoth;M. W. P. Savelsbergh.
(1999)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Georgia Institute of Technology
Georgia Institute of Technology
Centrum Wiskunde & Informatica
University of Brescia
École Supérieure des Sciences Économiques et Commerciales
Georgia Institute of Technology
HEC Montréal
HEC Montréal
Georgia Institute of Technology
University of Vienna
Pennsylvania State University
University of Waterloo
Henan Normal University
University of Patras
Centre national de la recherche scientifique, CNRS
University of California, Santa Barbara
University of Lisbon
University of Veterinary Medicine Vienna
Lancaster University
Sorbonne University
The University of Texas at Austin
Howard University
University of California, San Francisco
University of California, Riverside
University of California, Santa Barbara
Harvard University