default search action
Kyungsik Lee
Person information
- affiliation: Seoul National University, Korea
- affiliation (former): Department of Industrial & Management Engineering, Hankuk University of Foreign Studies, Korea
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j30]Jongyoon Park, Jinil Han, Kyungsik Lee:
Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem. Eur. J. Oper. Res. 317(1): 43-59 (2024) - [c4]Kyungsik Lee, Hana Yoo, Sumin Shin, Wooyoung Kim, Yeonung Baek, Hyunjin Kang, Jaehyun Kim, Kee-Eung Kim:
A Submodular Optimization Approach to Accountable Loan Approval. AAAI 2024: 22761-22769 - [c3]Kyungsik Lee, Youngmi Jun, Eunji Kim, Suhyun Kim, Seong Jae Hwang, Jonghyun Choi:
Kore Initial Clustering for Unsupervised Domain Adaptation. VISIGRAPP (2): VISAPP 2024: 425-432 - [i1]Junyoung Kim, Kyungsik Lee:
Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained binary knapsack problem. CoRR abs/2403.06686 (2024) - 2023
- [j29]Seulgi Joung, Seyoung Oh, Kyungsik Lee:
Comparative analysis of linear programming relaxations for the robust knapsack problem. Ann. Oper. Res. 323(1): 65-78 (2023) - [j28]Younsoo Lee, Kyungsik Lee:
Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups. Eur. J. Oper. Res. 310(1): 201-216 (2023) - 2022
- [j27]Junhyeok Lee, Kyungsik Lee, Ilkyeong Moon:
A reinforcement learning approach for multi-fleet aircraft recovery under airline disruption. Appl. Soft Comput. 129: 109556 (2022) - [j26]Jisun Lee, Seulgi Joung, Kyungsik Lee:
A fully polynomial time approximation scheme for the probability maximizing shortest path problem. Eur. J. Oper. Res. 300(1): 35-45 (2022) - [j25]Younsoo Lee, Kyungsik Lee:
New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups. Eur. J. Oper. Res. 302(1): 230-243 (2022) - [c2]Kyungsik Lee, Gunho Lee, Taejoon Song:
Enhanced configurable snapshot: snapshot-based fast booting on NAND flash with lifetime control. SAC 2022: 1166-1175 - 2021
- [j24]Sehwa Kim, Kyungsik Lee, Young-Seon Jeong:
Norm ball classifier for one-class classification. Ann. Oper. Res. 303(1): 433-482 (2021) - [j23]Jongheon Lee, Siyoung Lee, Kyungsik Lee:
Multistage Stochastic Optimization for Microgrid Operation Under Islanding Uncertainty. IEEE Trans. Smart Grid 12(1): 56-66 (2021) - 2020
- [j22]Seulgi Joung, Kyungsik Lee:
Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity. Optim. Lett. 14(1): 101-113 (2020)
2010 – 2019
- 2019
- [j21]Dongwook Kim, Kyungsik Lee, Ilkyeong Moon:
Stochastic facility location model for drones considering uncertain flight distance. Ann. Oper. Res. 283(1-2): 1283-1302 (2019) - [j20]Sue-Jeong Kwon, Seulgi Joung, Kyungsik Lee:
Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem. Comput. Oper. Res. 109: 159-169 (2019) - 2017
- [j19]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) - [j18]Kyoungmi Hwang, Kyungsik Lee, Sungsoo Park:
Variable selection methods for multi-class classification using signomial function. J. Oper. Res. Soc. 68(9): 1117-1130 (2017) - [j17]Kyungchul Park, Kyungsik Lee:
Distribution-robust loss-averse optimization. Optim. Lett. 11(1): 153-163 (2017) - 2016
- [j16]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) - [j15]Hyunseok Cho, Kyoung-Kuk Kim, Kyungsik Lee:
Computing lower bounds on basket option prices by discretizing semi-infinite linear programming. Optim. Lett. 10(8): 1629-1644 (2016) - [j14]Kyungchul Park, Kyungsik Lee:
Distribution-robust single-period inventory control problem with multiple unreliable suppliers. OR Spectr. 38(4): 949-966 (2016) - 2015
- [j13]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
- [j12]Kyungsik Lee, Norman Kim, Myong K. Jeong:
The sparse signomial classification and regression model. Ann. Oper. Res. 216(1): 257-286 (2014) - 2013
- [j11]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) - [j10]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
- [j9]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) - [j8]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) - 2010
- [j7]Kyungsik Lee:
Integral polyhedra related to integer multicommodity flows on a cycle. Discret. Appl. Math. 158(3): 235-238 (2010)
2000 – 2009
- 2009
- [j6]Kyungsik Lee, Kyungchul Park, Sungsoo Park:
A compact formulation of the ring loading problem with integer demand splitting. Oper. Res. Lett. 37(2): 111-113 (2009) - 2006
- [c1]Wanmo Kang, Kyungsik Lee:
Optimization Problems in the Simulation of Multifactor Portfolio Credit Risk. ICCSA (3) 2006: 777-784 - 2002
- [j5]Gue-woong Jeong, Kyungsik Lee, Sungsoo Park, Kyungchul Park:
A branch-and-price algorithm for the Steiner tree packing problem. Comput. Oper. Res. 29(3): 221-241 (2002) - 2000
- [j4]Taehan Lee, Kyungsik Lee, Sungsoo Park:
Optimal routing and wavelength assignment in WDM ring networks. IEEE J. Sel. Areas Commun. 18(10): 2146-2154 (2000) - [j3]Donghan Kang, Kyungsik Lee, Sungsoo Park, Kyungchul Park, Sang-Baeg Kim:
Design of local networks using USHRs. Telecommun. Syst. 14(1-4): 197-217 (2000)
1990 – 1999
- 1998
- [j2]Kyungsik Lee, Kyungchul Park, Sungsoo Park, Heesang Lee:
Economic spare capacity planning for DCS mesh-restorable networks. Eur. J. Oper. Res. 110(1): 63-75 (1998) - 1996
- [j1]Kyungsik Lee, Kyungchul Park, Sungsoo Park:
Design of capacitated networks with tree configurations. Telecommun. Syst. 6(1): 1-19 (1996)
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-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint