| 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 |
| 2007 | CPAIOR | Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches. | Davaatseren Baatar, Natashia Boland, Sebastian Brand, Peter J. Stuckey |
| 2002 | PATAT | A Hybrid Algorithm for the Examination Timetabling Problem. | Liam T. G. Merlot, Natashia Boland, Barry D. Hughes, Peter J. Stuckey |