Edward He

According to our database, Edward He authored at least 5 papers between 2018 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

An exact algorithm for the service network design problem with hub capacity constraints.

Edward He, Natashia Boland, George L. Nemhauser, Martin W. P. Savelsbergh

Networks, 2022

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

2021

Scalable Approaches to Time-Dependent Path and Routing Problems.

Edward Yuhang He

PhD thesis, 2021

Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting.

Edward He, Natashia Boland, George L. Nemhauser, Martin W. P. Savelsbergh

INFORMS J. Comput., 2021

2018

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

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018