Chungmok Lee
Orcid: 0000-0002-0274-6928
According to our database1,
Chungmok Lee
authored at least 25 papers
between 2011 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
An exact algorithm for maximum electric vehicle flow coverage problem with heterogeneous chargers, nonlinear charging time and route deviations.
Eur. J. Oper. Res., 2024
2022
A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm.
INFORMS J. Comput., 2022
2021
An exact algorithm for the electric-vehicle routing problem with nonlinear charging time.
J. Oper. Res. Soc., 2021
EURO J. Transp. Logist., 2021
A branch and price approach for the robust bandwidth packing problem with queuing delays.
Ann. Oper. Res., 2021
2020
A linear programming based heuristic algorithm for bandwidth packing problem with scheduling.
J. Oper. Res. Soc., 2020
2018
Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network.
Ann. Oper. Res., 2018
2017
Ann. Oper. Res., 2017
Ann. Oper. Res., 2017
2016
Math. Program., 2016
J. Oper. Res. Soc., 2016
2015
INFORMS J. Comput., 2015
2014
A Robust Scenario Approach for the Vehicle Routing Problem with Uncertain Travel Times.
Transp. Sci., 2014
IBM J. Res. Dev., 2014
Proceedings of the 23rd International World Wide Web Conference, 2014
Proceedings of the International Conference on Connected Vehicles and Expo, 2014
2013
Benders decomposition approach for the robust network design problem with flow bifurcations.
Networks, 2013
INFORMS J. Comput., 2013
Mathematical programming approaches for dual multicast routing problem with multilayer risk cost.
Ann. Oper. Res., 2013
2012
J. Oper. Res. Soc., 2012
Technical Note - Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations.
Oper. Res., 2012
2011