C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Seulgi Joung
ORCID
Publication Activity (10 Years)
Years Active: 2017-2023
Publications (10 Years): 9
Top Topics
Knapsack Problem
Top Venues
Comput. Oper. Res.
Oper. Res. Lett.
Ann. Oper. Res.
Networks
</>
Publications
</>
Seulgi Joung
Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees.
Comput. Oper. Res.
160 (2023)
Seulgi Joung
,
Seyoung Oh
,
Kyungsik Lee
Comparative analysis of linear programming relaxations for the robust knapsack problem.
Ann. Oper. Res.
323 (1) (2023)
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) (2022)
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) (2022)
Seulgi Joung
,
Kyungsik Lee
Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity.
Optim. Lett.
14 (1) (2020)
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) (2020)
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 (2019)
Seulgi Joung
,
Sungsoo Park
Lifting and separation of robust cover inequalities.
Networks
72 (2) (2018)
Seulgi Joung
,
Sungsoo Park
Lifting of probabilistic cover inequalities.
Oper. Res. Lett.
45 (5) (2017)