| 2018 | CPAIOR | Dealing with Demand Uncertainty in Service Network and Load Plan Design. | Ahmad Baubaid, Natashia Boland, Martin W. P. Savelsbergh |
| 2018 | CPAIOR | A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem. | Edward He, Natashia Boland, George L. Nemhauser, Martin W. P. Savelsbergh |
| 2017 | CPAIOR | 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 |
| 2014 | CPAIOR | Local Search for a Cargo Assembly Planning Problem. | Gleb Belov, Natashia Boland, Martin W. P. Savelsbergh, Peter J. Stuckey |
| 2014 | IPCO | The Triangle Splitting Method for Biobjective Mixed Integer Programming. | Natashia Boland, Hadi Charkhgard, Martin W. P. Savelsbergh |
| 2001 | IPCO | 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 |
| 1999 | IPCO | Valid Inequalities for Problems with Additive Variable Upper Bounds. | Alper Atamtrk, George L. Nemhauser, Martin W. P. Savelsbergh |
| 1999 | SODA | Online Resource Minimization. | Anton J. Kleywegt, Vijay S. Nori, Martin W. P. Savelsbergh, Craig A. Tovey |
| 1998 | SODA | An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems. | Martin W. P. Savelsbergh, R. N. Uma, Joel Wein |
| 1995 | IPCO | Sequence Independent Lifting of Cover Inequalities. | Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh |