Research Interest
Routing Problems with Multiple Agents, Lot-sizing and scheduling problem
Theory and Methodologies of Discrete Optimization (Integer Programming and Combinatorial Optimization) : Linear Programming, Polyhedral Theory, Cutting Plane Theory, Graph Theory and Network Optimization, Branch-and-cut & Branch-and-price approaches to NP-hard problems
Decision Making under Uncertainty : Robust Optimization, Capacity and Inventory Management under Uncertainty
Application of Optimization Methdologies to the Design and Strategic/Tactical/Operational planning & scheduling (in power, logistics, manufacturing, telecommunication)
Publications
Oh, S., & Lee, K. (2025). New integer optimization models and decomposition-based algorithms for the multi-agent pathfinding problem with time-spacing constraints. European Journal of Operational Research.
Oh, S., Jeong, J., Lee, Y., & Lee, K. (2026). A branch-and-price algorithm for the parallel-line lot-sizing and scheduling problem in flat-panel display manufacturing process. Omega, 138, 103386.
Joung, S., Oh, S., & Lee, K. (2023). Comparative analysis of linear programming relaxations for the robust knapsack problem. Annals of Operations Research, 323(1), 65-78.
On-going Projects
이질적 로봇 군집의 제어 불확실성 대응을 위한 최적 강건 경로 계획 프레임워크: 계층적 시공간 이산화 및 분해기법, 한국연구재단, 2026.09.01 - 2029.08.31.
모듈 단위 공정 최적화를 통한 미세 제어 방법론 연구, 민간기업, 2025.07.01 - 2026.12.31.