Login / Signup
Edward He
ORCID
Publication Activity (10 Years)
Years Active: 2018-2022
Publications (10 Years): 3
Top Topics
Shortest Path Problem
Top Venues
Networks
INFORMS J. Comput.
CPAIOR
</>
Publications
</>
Edward He
,
Natashia Boland
,
George L. Nemhauser
,
Martin W. P. Savelsbergh
An exact algorithm for the service network design problem with hub capacity constraints.
Networks
80 (4) (2022)
Edward He
,
Natashia Boland
,
George L. Nemhauser
,
Martin W. P. Savelsbergh
Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting.
INFORMS J. Comput.
33 (3) (2021)
Edward He
,
Natashia Boland
,
George L. Nemhauser
,
Martin W. P. Savelsbergh
A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem.
CPAIOR
(2018)