Research Interest
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, etc.)
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.