Seulgi Joung

Seulgi Joung

Assoc. Prof. at Ajou Univ.

Publications

Publications - International Journal

(You can also find my articles on my Google Scholar profile)

  1. Y. Lee, K. Seo, S. Joung and S. Park*. “An exact approach for the Stackelberg knapsack problem with weight selection.”, Journal of Global Optimization 2025: 1-19. https://doi.org/10.1007/s10898-025-01488-3
  2. N. Lee†, H. Lee† and S. Joung*. “A wake-induced two-phase planning framework for offshore wind farm maintenance with stochastic mixed-integer programming.” Applied Energy 380 2025: 124976. https://doi.org/10.1016/j.apenergy.2024.124976
  3. S. Kang, J. Kim*, S. Joung and K. Lee*. “Theoretical analysis of integer programming models for the two-dimensional two-staged knapsack problem.” Optimization Letters 2024: 1-32. https://doi.org/10.1007/s11590-024-02164-3
  4. S. Joung, J. Ryu, SH. Kwon, J. Shin and S. Park*. “Linear programming based heuristic algorithms for tunnel assignment and reconfiguration in MPLS networks.” Telecommunication Systems 87 2024: 991-1013. https://doi.org/10.1007/s11235-024-01217-3
  5. J. Lee, S. Joung and K. Lee*. “Scalable optimization approaches for microgrid operation under stochastic islanding and net load.” Applied Energy 374 2024: 124040. https://doi.org/10.1016/j.apenergy.2024.124040
  6. S. Joung*. “A new sequential lifting of robust cover inequalities.” Optimization Letters 18 2024: 925–941. https://doi.org/10.1007/s11590-023-02027-3
  7. S. Joung*. “Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees.” Computers & Operations Research 160 2023: 106374. https://doi.org/10.1016/j.cor.2023.106374
  8. S. Joung, S. Oh* and K. Lee*. “Comparative analysis of linear programming relaxations for the robust knapsack problem.” Annals of Operations Research 323(1) 2023: 65-78. https://doi.org/10.1007/s10479-022-05161-w
  9. K. Seo, S. Joung, C. Lee and S. Park*. “A closest Benders cut selection scheme for accelerating the Benders decomposition algorithm.” INFORMS Journal on Computing 34(5) 2022: 2804-2827. https://doi.org/10.1287/ijoc.2022.1207
  10. J. Lee, S. Joung* and K. Lee*. “A fully polynomial time approximation scheme for the probability maximizing shortest path problem.” European Journal of Operational Research 300(1) 2022: 35-45. https://doi.org/10.1016/j.ejor.2021.10.018
  11. S. Joung and S. Park*. “Robust mixed 0-1 programming and submodularity.” INFORMS Journal on Optimization 3(2) 2021: 183-199. https://doi.org/10.1287/ijoo.2019.0042
  12. S. Joung and K. Lee*. “Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity.” Optimization Letters 14(1) 2020: 101-113. https://doi.org/10.1007/s11590-019-01445-6
  13. S. Joung, J. Lim, C. Lee*, J. Shin, I. Jung and S. Park*. “A linear programming based heuristic algorithm for bandwidth packing problem with scheduling.” Journal of the Operational Research Society 71(2) 2020: 250-263. https://doi.org/10.1080/01605682.2018.1542959
  14. SJ. Kwon, S. Joung and K.Lee*. “Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem.” Computers & Operations Research 109 2019: 159-169. https://doi.org/10.1016/j.cor.2019.05.005
  15. S. Joung and S. Park*. “Lifting and separation of robust cover inequalities.” Networks 72(2) 2018: 272-305. https://doi.org/10.1002/net.21829
  16. S. Joung and S. Park*. “Lifting of probabilistic cover inequalities.” Operations Research Letters 45(5) 2017: 513-518. https://doi.org/10.1016/j.orl.2017.08.006

    *: corresponding authors, †: equally contributed authors

Publications - Domestic Journal

  1. 이현태, 윤범, 조예림, 이수현, 정슬기*, “정수계획법을 활용한 시차를 고려한 온라인 학회 스케줄링 방법 제안.” 경영과학 40(1) 2023: 61-70. https://doi.org/10.7737/KMSR.2023.40.1.061
  2. 전홍배, 신기태, 정슬기*, “정량 분석을 통해 살펴본 산업공학 전공의 현황.” 대한산업공학회지 48(3) 2022: 265-270. https://doi.org/10.7232/JKIIE.2022.48.3.265 (대한산업공학회 산업공학 위상강화 TF팀, 2021-2022)
  3. 정슬기*, “k-부분보형 부등식과 불확실성을 고려한 이산최적화 문제.” 한국경영과학회지 47(2) 2022: 25-34. https://doi.org/10.7737/JKORMS.2022.47.2.025 (전남대학교 교내 과제 2021-2158)