Martin W. P. Savelsbergh

Industrial and Manufacturing Engineering · 1998–2019

A researcher in the Science corpus: 17 papers; trusts 12 researchers and is trusted by 38 researchers here, as inferred from the citation graph.

Subfields

• Industrial and Manufacturing Engineering — 28 citations into it; #184 of 2,521 by trust here, #547 by citations
• Automotive Engineering — 21 citations into it; #218 of 3,081 by trust here, #779 by citations
• Building and Construction — 10 citations into it; #628 of 2,909 by trust here, #692 by citations
• Computer Networks and Communications — 10 citations into it; #4,013 of 9,886 by trust here, #4,757 by citations
• Transportation — 9 citations into it; #378 of 2,062 by trust here, #316 by citations
• Computational Theory and Mathematics — 6 citations into it; #9,761 of 12,182 by trust here, #8,756 by citations

Whom Martin W. P. Savelsbergh trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Niels A. H. Agatz
2. Tobias Achterberg
3. Erling D. Andersen
4. Martin L. Puterman
5. David S. Johnson
6. Michael Drexl
7. Gerardo Berbeglia
8. Jeff T. Linderoth
9. Cathy Macharis
10. Michael E. Porter

Who trusts Martin W. P. Savelsbergh overall

1. Alp M. Arslan
2. Andrea Lodi
3. Jagat Patel
4. Niels A. H. Agatz
5. Elias Boutros Khalil
6. Claudia Archetti
7. Matheus Guedes Vilas Boas
8. Pierre Bonami
9. F. Kılınç-Karzan
10. Arnaud Fréville

Papers from Martin W. P. Savelsbergh's perspective

Ordered by how strongly the researchers Martin W. P. Savelsbergh trusts endorse each paper. Same corpus, a different order for every researcher.

1. Dynamic pickup and delivery problems (European Journal of Operational Research)
2. Static pickup and delivery problems: a classification scheme and survey
3. The dial-a-ride problem: models and algorithms (Annals of Operations Research)
4. Synchronization in Vehicle Routing - A Survey of VRPs with Multiple Synchronization Constraints (Transportation Science)
5. Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers (Operational Research)
6. The NP-Completeness Column: An Ongoing Guide
7. A Computational Study of Search Strategies for Mixed Integer Programming
8. Network hub location problems: The state of the art (European Journal of Operational Research)
9. Branching rules revisited
10. THE 2004 URBAN MOBILITY REPORT

Their papers

• Integer-Programming Software Systems (2005) — 232 citations
• Information-based branching schemes for binary linear mixed integer problems (2009) — 67 citations
• The generalized independent set problem: Polyhedral analysis and solution approaches (2017) — 27 citations
• Service and capacity planning in crowd-sourced delivery (2019) — 132 citations
• A branch-and-price algorithm for the vehicle routing problem with roaming delivery locations (2017) — 101 citations
• The Vehicle Routing Problem with Occasional Drivers (2016) — 372 citations
• 50th Anniversary Invited Article - City Logistics: Challenges and Opportunities (2016) — 609 citations
• The benefits of meeting points in ride-sharing systems (2015) — 320 citations
• Dynamic ridesharing: Is there a role for dedicated drivers? (2015) — 112 citations
• Optimization for dynamic ride-sharing: A review (2012) — 985 citations
• Dynamic ride-sharing: A simulation study in metro Atlanta (2011) — 541 citations
• A Decomposition Approach for the Inventory-Routing Problem (2004) — 333 citations
• The Stochastic Inventory Routing Problem with Direct Deliveries (2002) — 355 citations
• Solving Multi-Item Capacitated Lot-Sizing Problems with Setup Times by Branch-and-Cut (2000) — 56 citations
• Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition (2000) — 221 citations
• A Computational Study of Search Strategies for Mixed Integer Programming (1999)
• Branch-and-Price: Column Generation for Solving Huge Integer Programs (1998)