Sungsoo Park

KAIST

H-index: 25

Asia-South Korea

Sungsoo Park, With an exceptional h-index of 25 and a recent h-index of 14 (since 2020), a distinguished researcher at KAIST,

His recent articles reflect a diverse array of research interests and contributions to the field:

The column generation approach to the mean-risk model for the portfolio selection problem with spillover risk aversion

A closest Benders cut selection scheme for accelerating the Benders decomposition algorithm

A branch-and-price algorithm for the robust single-source capacitated facility location problem under demand uncertainty

Using the WOWA criterion for two-stage decision making problems

Robust mixed 0-1 programming and submodularity

On using cardinality constrained uncertainty for objective coefficients in robust optimization

Robust solutions for stochastic and distributionally robust chance-constrained binary knapsack problems

A robust contingency-constrained unit commitment with an N-αk security criterion

Title	Journal	Author(s)	Publication Date
The column generation approach to the mean-risk model for the portfolio selection problem with spillover risk aversion	The Engineering Economist	Hwayong Choi Chungmok Lee Sungsoo Park	2024/1/2
A closest Benders cut selection scheme for accelerating the Benders decomposition algorithm	INFORMS Journal on Computing	Kiho Seo Seulgi Joung Chungmok Lee Sungsoo Park	2022/9
A branch-and-price algorithm for the robust single-source capacitated facility location problem under demand uncertainty	EURO Journal on Transportation and Logistics	Jaehyeon Ryu Sungsoo Park	2022/1/1
Using the WOWA criterion for two-stage decision making problems	arXiv preprint arXiv:2104.07239	Jaeyoong Lim Sungsoo Park	2021/4/15
Robust mixed 0-1 programming and submodularity	INFORMS Journal on Optimization	Seulgi Joung Sungsoo Park	2021/1
On using cardinality constrained uncertainty for objective coefficients in robust optimization	Optimization Letters	Jaeyoong Lim Sungsoo Park	2021/6
Robust solutions for stochastic and distributionally robust chance-constrained binary knapsack problems	arXiv preprint arXiv:2105.11875	Jaehyeon Ryu Sungsoo Park	2021/5/25
A robust contingency-constrained unit commitment with an N-αk security criterion	International Journal of Electrical Power & Energy Systems	Jaehee Jeong Sungsoo Park	2020/12/1
A linear programming based heuristic algorithm for bandwidth packing problem with scheduling	Omega	Shunji Umetani Yuta Fukushima Hiroshi Morita	2017/3/1

Useful Links