| Algorithms for the variable sized bin packing problem J Kang, S Park European Journal of Operational Research 147 (2), 365-372, 2003 | 242 | 2003 |
| Robust vehicle routing problem with deadlines and travel time/demand uncertainty C Lee, K Lee, S Park Journal of the Operational Research Society 63 (9), 1294-1306, 2012 | 189 | 2012 |
| Optimal routing and wavelength assignment in WDM ring networks T Lee, K Lee, S Park IEEE Journal on Selected areas in Communications 18 (10), 2146-2154, 2000 | 123 | 2000 |
| Efficient solution procedure and reduced size formulations for p-hub location problems J Sohn, S Park European Journal of Operational Research 108 (1), 118-126, 1998 | 122 | 1998 |
| Modeling and solving the spatial block scheduling problem in a shipbuilding company K Park, K Lee, S Park, S Kim Computers & industrial engineering 30 (3), 357-364, 1996 | 103 | 1996 |
| A linear program for the two-hub location problem J Sohn, S Park European Journal of Operational Research 100 (3), 617-622, 1997 | 102 | 1997 |
| A polyhedral approach to edge coloring GL Nemhauser, S Park Operations Research Letters 10 (6), 315-322, 1991 | 91 | 1991 |
| The single allocation problem in the interacting three‐hub network J Sohn, S Park Networks: An International Journal 35 (1), 17-25, 2000 | 81 | 2000 |
| A robust scenario approach for the vehicle routing problem with uncertain travel times J Han, C Lee, S Park Transportation science 48 (3), 373-390, 2014 | 80 | 2014 |
| An extended formulation approach to the edge-weighted maximal clique problem K Park, K Lee, S Park European Journal of Operational Research 95 (3), 671-682, 1996 | 80 | 1996 |
| An integer programming approach to the bandwidth packing problem K Park, S Kang, S Park Management science 42 (9), 1277-1291, 1996 | 79 | 1996 |
| A strong cutting plane algorithm for the robotic assembly line balancing problem H Kim, S Park International Journal of Production Research 33 (8), 2311-2323, 1995 | 74 | 1995 |
| Efficient operation of a surface mounting machine with a multihead turret J Sohn, S Park International Journal of Production Research 34 (4), 1131-1143, 1996 | 68 | 1996 |
| Lifting cover inequalities for the precedence-constrained knapsack problem K Park, S Park Discrete Applied Mathematics 72 (3), 219-241, 1997 | 63 | 1997 |
| An Optimization Approach to Routing and Wavelength Assignment in WDM All‐Optical Mesh Networks without Wavelength Conversion K Lee, KC Kang, T Lee, S Park ETRI journal 24 (2), 131-141, 2002 | 61 | 2002 |
| A heuristic for an assembly line balancing problem with incompatibility, range, and partial precedence constraints K Park, S Park, W Kim Computers & Industrial Engineering 32 (2), 321-332, 1997 | 59 | 1997 |
| Telecommunication node clustering with node compatibility and network survivability requirements K Park, K Lee, S Park, H Lee Management Science 46 (3), 363-374, 2000 | 58 | 2000 |
| Benders decomposition approach for the robust network design problem with flow bifurcations C Lee, K Lee, S Park Networks 62 (1), 1-16, 2013 | 46 | 2013 |
| Lagrangian relaxation approach to the targeting problem O Kwon, D Kang, K Lee, S Park Naval Research Logistics (NRL) 46 (6), 640-653, 1999 | 42 | 1999 |
| Branch-and-price-and-cut approach to the robust network design problem without flow bifurcations C Lee, K Lee, K Park, S Park Operations Research 60 (3), 604-610, 2012 | 40 | 2012 |
