Lifting of probabilistic cover inequalities. - Seulgi Joung; Sungsoo Park (Oper. Res. Lett., 2017)

Lifting and separation of robust cover inequalities. - Seulgi Joung; Sungsoo Park (Networks, 2018)

Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem. - Sue-Jeong Kwon; Seulgi Joung; Kyungsik Lee (Comput. Oper. Res., 2019)

A linear programming based heuristic algorithm for bandwidth packing problem with scheduling. - Seulgi Joung; Jaeyoong Lim; Chungmok Lee; Jongyoon Shin; Ikkyun Jung; Sungsoo Park (J. Oper. Res. Soc., 2020)

Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity. - Seulgi Joung; Kyungsik Lee (Optim. Lett., 2020)

Robust Mixed 0-1 Programming and Submodularity. - Seulgi Joung; Sungsoo Park (INFORMS J. Optim., 2021)

A fully polynomial time approximation scheme for the probability maximizing shortest path problem. - Jisun Lee; Seulgi Joung; Kyungsik Lee (Eur. J. Oper. Res., 2022)

A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm. - Kiho Seo; Seulgi Joung; Chungmok Lee; Sungsoo Park (INFORMS J. Comput., 2022)

Comparative analysis of linear programming relaxations for the robust knapsack problem. - Seulgi Joung; Seyoung Oh; Kyungsik Lee (Ann. Oper. Res., 2023)

Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees. - Seulgi Joung (Comput. Oper. Res., 2023)

A new sequential lifting of robust cover inequalities. - Seulgi Joung (Optim. Lett., 2024)

Linear programming based heuristic algorithms for tunnel assignment and reconfiguration in MPLS networks. - Seulgi Joung; Jaehyeon Ryu; Sunhyeon Kwon; Jongyoon Shin; Sungsoo Park (Telecommun. Syst., 2024)

Theoretical analysis of integer programming models for the two-dimensional two-staged knapsack problem. - Suho Kang; Junyoung Kim; Seulgi Joung; Kyungsik Lee (Optim. Lett., 2025)