About strongly polynomial time algorithms for quadratic optimization over submodular constraints. - Dorit S. Hochbaum; Sung-Pil Hong (Math. Program., 1995)

A note on the strong polynomiality of convex quadratic programming. - Sung-Pil Hong; Sushil Verma (Math. Program., 1995)

On the Complexity of the Production-Transportation Problem. - Dorit S. Hochbaum; Sung-Pil Hong (SIAM J. Optim., 1996)

Towards Real-Time Optimal Management of Virtual Paths in ATM-Based B-ISDN's. - Sung-Jin Chung; Sung-Pil Hong; Hae-Goo Song; Sang-Baeg Kim (ICC (1), 1997)

An Efficient Multicast Routing Algorithm for Delay-Sensitive Applications with Dynamic Membership. - Sung-Pil Hong; Heesang Lee; Bum Hwan Park (INFOCOM, 1998)

A Competitive Online Algorithm for the Paging Problem with "Shelf" Memory. - Sung-Pil Hong (COCOON, 1999)

Towards real-time optimal VP management for ATM nets. - Sung-Jin Chung; Sung-Pil Hong; Hae-Goo Song (Telecommun. Syst., 2000)

A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. - Sung-Pil Hong; Sung-Jin Chung; Bum Hwan Park (Oper. Res. Lett., 2004)

Two-Server Network Disconnection Problem. - Byung-Cheon Choi; Sung-Pil Hong (ICCSA (3), 2006)

Connection-level QoS provisioning in multiple transmission technology-based OFDM system. - Youngkyu Choi; Sunghyun Choi 001; Sung-Pil Hong (WiOpt, 2006)

Approximability of the k-server disconnection problem. - Sung-Pil Hong; Byung-Cheon Choi (Networks, 2007)

Polynomiality of sparsest cuts with fixed number of sources. - Sung-Pil Hong; Byung-Cheon Choi (Oper. Res. Lett., 2007)

Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra. - Sung-Pil Hong; Levent Tunçel (Discret. Appl. Math., 2008)

Optimal search-relocation trade-off in Markovian-target searching. - Sung-Pil Hong; Sung-Jin Cho; Myoung-Ju Park; Moon-Gul Lee (Comput. Oper. Res., 2009)

A genetic algorithm for joint replenishment based on the exact inventory cost. - Sung-Pil Hong; Yong-Hyuk Kim (Comput. Oper. Res., 2009)

A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search. - Sung-Pil Hong; Sung-Jin Cho; Myoung-Ju Park (Eur. J. Oper. Res., 2009)

Approximation of the k-batch consolidation problem. - Sung-Pil Hong; Myoung-Ju Park; Soo Y. Chang (Theor. Comput. Sci., 2009)

Approximation of a batch consolidation problem. - Junho Chang; Soo Y. Chang; Sung-Pil Hong; Yun-Hong Min; Myoung-Ju Park (Networks, 2011)

Rank of Handelman hierarchy for Max-Cut. - Myoung-Ju Park; Sung-Pil Hong (Oper. Res. Lett., 2011)

Column Generation Approach to Line Planning with Various Halting Patterns - Application to the Korean High-Speed Railway. - Bum Hwan Park; Yong-Il Seo; Sung-Pil Hong; Hag-Lae Rho (Asia Pac. J. Oper. Res., 2013)

Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications. - Myoung-Ju Park; Sung-Pil Hong (J. Glob. Optim., 2013)

Estimating heterogeneous agent preferences by inverse optimization in a randomized nonatomic game. - Sung-Pil Hong; Kyung Min Kim; Suk-Joon Ko (Ann. Oper. Res., 2021)

The College Application Problem. - Max Kapur; Sung-Pil Hong (CoRR, 2022)

Inverse interval scheduling via reduction on a single machine. - Seho Yim; Sung-Pil Hong; Myoung-Ju Park; Yerim Chung (Eur. J. Oper. Res., 2022)