A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem. - Edward He 001; Natashia Boland; George L. Nemhauser; Martin W. P. Savelsbergh (CPAIOR, 2018)

Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting. - Edward He 001; Natashia Boland; George L. Nemhauser; Martin W. P. Savelsbergh (INFORMS J. Comput., 2021)

Scalable Approaches to Time-Dependent Path and Routing Problems. - Edward Yuhang He (2021)

Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems. - Edward Yuhang He; Natashia Boland; George L. Nemhauser; Martin W. P. Savelsbergh (INFORMS J. Comput., 2022)

An exact algorithm for the service network design problem with hub capacity constraints. - Edward He 001; Natashia Boland; George L. Nemhauser; Martin W. P. Savelsbergh (Networks, 2022)