Seulgi Joung

According to our database, Seulgi Joung authored at least 11 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

A new sequential lifting of robust cover inequalities.

Seulgi Joung

Optim. Lett., May, 2024

2023

Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees.

Seulgi Joung

Comput. Oper. Res., December, 2023

Comparative analysis of linear programming relaxations for the robust knapsack problem.

Seulgi Joung, Seyoung Oh, Kyungsik Lee

Ann. Oper. Res., April, 2023

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

A fully polynomial time approximation scheme for the probability maximizing shortest path problem.

Jisun Lee, Seulgi Joung, Kyungsik Lee

Eur. J. Oper. Res., 2022

2021

Robust Mixed 0-1 Programming and Submodularity.

Seulgi Joung, Sungsoo Park

INFORMS J. Optim., January, 2021

2020

Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity.

Seulgi Joung, Kyungsik Lee

Optim. Lett., 2020

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

2019

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

2018

Lifting and separation of robust cover inequalities.

Seulgi Joung, Sungsoo Park

Networks, 2018

2017

Lifting of probabilistic cover inequalities.

Seulgi Joung, Sungsoo Park

Oper. Res. Lett., 2017