default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChungmok Lee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Hyunwoo Park, Chungmok Lee
:
An exact algorithm for maximum electric vehicle flow coverage problem with heterogeneous chargers, nonlinear charging time and route deviations. Eur. J. Oper. Res. 315(3): 926-951 (2024)- 2022
- [j22]Chungmok Lee:
A robust optimization approach with probe-able uncertainty. Eur. J. Oper. Res. 296(1): 218-239 (2022) - [j21]Kiho Seo, Seulgi Joung, Chungmok Lee, Sungsoo Park:
A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm. INFORMS J. Comput. 34(5): 2804-2827 (2022) - 2021
- [j20]Seohee Kim, Chungmok Lee:
A branch and price approach for the robust bandwidth packing problem with queuing delays. Ann. Oper. Res. 307(1): 251-275 (2021) - [j19]Chungmok Lee, Rahul Nair:
Robust transit line planning based on demand estimates obtained from mobile phones. EURO J. Transp. Logist. 10: 100034 (2021) - [j18]Chungmok Lee:
An exact algorithm for the electric-vehicle routing problem with nonlinear charging time. J. Oper. Res. Soc. 72(7): 1461-1485 (2021) - [j17]Munjeong Kang, Chungmok Lee:
An Exact Algorithm for Heterogeneous Drone-Truck Routing Problem. Transp. Sci. 55(5): 1088-1112 (2021) - 2020
- [j16]Seulgi Joung, Jaeyoong Lim, Chungmok Lee, Jongyoon Shin, Ikkyun Jung, Sungsoo Park:
A linear programming based heuristic algorithm for bandwidth packing problem with scheduling. J. Oper. Res. Soc. 71(2): 250-263 (2020)
2010 – 2019
- 2018
- [j15]Jiyoung Choi, Chungmok Lee, Sungsoo Park:
Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network. Ann. Oper. Res. 264(1-2): 57-87 (2018) - 2017
- [j14]Chun-An Chou, Tibérius O. Bonates, Chungmok Lee, Wanpracha Art Chaovalitwongse:
Multi-pattern generation framework for logical analysis of data. Ann. Oper. Res. 249(1-2): 329-349 (2017) - [j13]Kyoungmi Hwang, Dohyun Kim, Kyungsik Lee, Chungmok Lee, Sungsoo Park:
Embedded variable selection method using signomial classification. Ann. Oper. Res. 254(1-2): 89-109 (2017) - 2016
- [j12]Dohyun Kim, Chungmok Lee, Sangheum Hwang, Myong K. Jeong:
A robust support vector regression with a linear-log concave loss function. J. Oper. Res. Soc. 67(5): 735-742 (2016) - [j11]Jinil Han, Kyungsik Lee, Chungmok Lee, Ki-Seok Choi, Sungsoo Park:
Robust optimization approach for a chance-constrained binary knapsack problem. Math. Program. 157(1): 277-296 (2016) - 2015
- [j10]Chungmok Lee, Minh Pham, Myong Kee Jeong, Dohyun Kim, Dennis K. J. Lin, Wanpracha Art Chaovalitwongse:
A Network Structural Approach to the Link Prediction Problem. INFORMS J. Comput. 27(2): 249-267 (2015) - [j9]Kyoungmi Hwang, Kyungsik Lee, Chungmok Lee, Sungsoo Park:
Multi-class classification using a signomial function. J. Oper. Res. Soc. 66(3): 434-449 (2015) - 2014
- [j8]Ban Kawas, Ali Koc, Marco Laumanns, Chungmok Lee, Radu Marinescu, Martin Mevissen, Nicole Taheri, Susara Van den Heever, Rudi Verago:
Unified framework and toolkit for commerce optimization under uncertainty. IBM J. Res. Dev. 58(5/6) (2014) - [j7]Jinil Han, Chungmok Lee, Sungsoo Park:
A Robust Scenario Approach for the Vehicle Routing Problem with Uncertain Travel Times. Transp. Sci. 48(3): 373-390 (2014) - [c2]Randall Cogill, Olivier Gallay, Wynita M. Griggs, Chungmok Lee, Zubair Nabi, Rodrigo H. Ordóñez-Hurtado, Martin Rufli, Robert Shorten, Tigran T. Tchrakian, Rudi Verago, Fabian R. Wirth, Sergiy Zhuk:
Parked cars as a service delivery platform. ICCVE 2014: 138-143 - [c1]Chungmok Lee, Minh Pham, Norman Kim, Myong K. Jeong, Dennis K. J. Lin, Wanpracha Art Chaovalitwongse:
A novel link prediction approach for scale-free networks. WWW (Companion Volume) 2014: 1333-1338 - 2013
- [j6]Zhe Liang, Chungmok Lee, Wanpracha Art Chaovalitwongse:
Mathematical programming approaches for dual multicast routing problem with multilayer risk cost. Ann. Oper. Res. 203(1): 101-118 (2013) - [j5]Jinil Han, Kyungsik Lee, Chungmok Lee, Sungsoo Park:
Exact Algorithms for a Bandwidth Packing Problem with Queueing Delay Guarantees. INFORMS J. Comput. 25(3): 585-596 (2013) - [j4]Chungmok Lee, Kyungsik Lee, Sungsoo Park:
Benders decomposition approach for the robust network design problem with flow bifurcations. Networks 62(1): 1-16 (2013) - 2012
- [j3]Chungmok Lee, Kyungsik Lee, Kyungchul Park, Sungsoo Park:
Technical Note - Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations. Oper. Res. 60(3): 604-610 (2012) - [j2]Chungmok Lee, Kyungsik Lee, Sungsoo Park:
Robust vehicle routing problem with deadlines and travel time/demand uncertainty. J. Oper. Res. Soc. 63(9): 1294-1306 (2012) - 2011
- [j1]Chungmok Lee, Sungsoo Park:
Chebyshev center based column generation. Discret. Appl. Math. 159(18): 2251-2265 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-16 19:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
