Kyungsik Lee

Orcid: 0000-0002-4543-2312

Affiliations:
  • Seoul National University, Korea
  • Department of Industrial & Management Engineering, Hankuk University of Foreign Studies, Korea (former)


According to our database1, Kyungsik Lee authored at least 35 papers between 1996 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem.
Eur. J. Oper. Res., 2024

Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained binary knapsack problem.
CoRR, 2024

Kore Initial Clustering for Unsupervised Domain Adaptation.
Proceedings of the 19th International Joint Conference on Computer Vision, 2024

A Submodular Optimization Approach to Accountable Loan Approval.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Comparative analysis of linear programming relaxations for the robust knapsack problem.
Ann. Oper. Res., April, 2023

Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups.
Eur. J. Oper. Res., 2023

2022
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., 2022

A fully polynomial time approximation scheme for the probability maximizing shortest path problem.
Eur. J. Oper. Res., 2022

A reinforcement learning approach for multi-fleet aircraft recovery under airline disruption.
Appl. Soft Comput., 2022

Enhanced configurable snapshot: snapshot-based fast booting on NAND flash with lifetime control.
Proceedings of the SAC '22: The 37th ACM/SIGAPP Symposium on Applied Computing, Virtual Event, April 25, 2022

2021
Multistage Stochastic Optimization for Microgrid Operation Under Islanding Uncertainty.
IEEE Trans. Smart Grid, 2021

Norm ball classifier for one-class classification.
Ann. Oper. Res., 2021

2020
Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity.
Optim. Lett., 2020

2019
Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem.
Comput. Oper. Res., 2019

Stochastic facility location model for drones considering uncertain flight distance.
Ann. Oper. Res., 2019

2017
Distribution-robust loss-averse optimization.
Optim. Lett., 2017

Variable selection methods for multi-class classification using signomial function.
J. Oper. Res. Soc., 2017

Embedded variable selection method using signomial classification.
Ann. Oper. Res., 2017

2016
Distribution-robust single-period inventory control problem with multiple unreliable suppliers.
OR Spectr., 2016

Computing lower bounds on basket option prices by discretizing semi-infinite linear programming.
Optim. Lett., 2016

Robust optimization approach for a chance-constrained binary knapsack problem.
Math. Program., 2016

2015
Multi-class classification using a signomial function.
J. Oper. Res. Soc., 2015

2014
The sparse signomial classification and regression model.
Ann. Oper. Res., 2014

2013
Benders decomposition approach for the robust network design problem with flow bifurcations.
Networks, 2013

Exact Algorithms for a Bandwidth Packing Problem with Queueing Delay Guarantees.
INFORMS J. Comput., 2013

2012
Robust vehicle routing problem with deadlines and travel time/demand uncertainty.
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

2010
Integral polyhedra related to integer multicommodity flows on a cycle.
Discret. Appl. Math., 2010

2009
A compact formulation of the ring loading problem with integer demand splitting.
Oper. Res. Lett., 2009

2006
Optimization Problems in the Simulation of Multifactor Portfolio Credit Risk.
Proceedings of the Computational Science and Its Applications, 2006

2002
A branch-and-price algorithm for the Steiner tree packing problem.
Comput. Oper. Res., 2002

2000
Design of local networks using USHRs.
Telecommun. Syst., 2000

Optimal routing and wavelength assignment in WDM ring networks.
IEEE J. Sel. Areas Commun., 2000

1998
Economic spare capacity planning for DCS mesh-restorable networks.
Eur. J. Oper. Res., 1998

1996
Design of capacitated networks with tree configurations.
Telecommun. Syst., 1996


  Loading...