Sung-Pil Hong

24 papers A* 1B 1Misc 1Journal 19Unranked 2
YearRankTypeTitle / Venue / Authors
2022 J jnl
Inverse interval scheduling via reduction on a single machine.
Eur. J. Oper. Res.
Seho Yim, Sung-Pil Hong, Myoung-Ju Park, Yerim Chung
2022 J jnl
The College Application Problem.
CoRR
Max Kapur, Sung-Pil Hong
2021 J jnl
Estimating heterogeneous agent preferences by inverse optimization in a randomized nonatomic game.
Ann. Oper. Res.
Sung-Pil Hong, Kyung Min Kim, Suk-Joon Ko
2013 J jnl
Column Generation Approach to Line Planning with Various Halting Patterns - Application to the Korean High-Speed Railway.
Asia Pac. J. Oper. Res.
Bum Hwan Park, Yong-Il Seo, Sung-Pil Hong, Hag-Lae Rho
2013 J jnl
Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications.
J. Glob. Optim.
Myoung-Ju Park, Sung-Pil Hong
2011 J jnl
Approximation of a batch consolidation problem.
Networks
Junho Chang, Soo Y. Chang, Sung-Pil Hong, Yun-Hong Min, Myoung-Ju Park
2011 J jnl
Rank of Handelman hierarchy for Max-Cut.
Oper. Res. Lett.
Myoung-Ju Park, Sung-Pil Hong
2009 J jnl
A genetic algorithm for joint replenishment based on the exact inventory cost.
Comput. Oper. Res.
Sung-Pil Hong, Yong-Hyuk Kim
2009 J jnl
A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search.
Eur. J. Oper. Res.
Sung-Pil Hong, Sung-Jin Cho, Myoung-Ju Park
2009 J jnl
Approximation of the k-batch consolidation problem.
Theor. Comput. Sci.
Sung-Pil Hong, Myoung-Ju Park, Soo Y. Chang
2009 J jnl
Optimal search-relocation trade-off in Markovian-target searching.
Comput. Oper. Res.
Sung-Pil Hong, Sung-Jin Cho, Myoung-Ju Park, Moon-Gul Lee
2008 J jnl
Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra.
Discret. Appl. Math.
Sung-Pil Hong, Levent Tunçel
2007 J jnl
Approximability of the
Networks
Sung-Pil Hong, Byung-Cheon Choi
2007 J jnl
Polynomiality of sparsest cuts with fixed number of sources.
Oper. Res. Lett.
Sung-Pil Hong, Byung-Cheon Choi
2006 B conf
Connection-level QoS provisioning in multiple transmission technology-based OFDM system.
WiOpt
Youngkyu Choi, Sunghyun Choi, Sung-Pil Hong
2006 — conf
Two-Server Network Disconnection Problem.
ICCSA (3)
Byung-Cheon Choi, Sung-Pil Hong
2004 J jnl
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.
Oper. Res. Lett.
Sung-Pil Hong, Sung-Jin Chung, Bum Hwan Park
2000 J jnl
Towards real-time optimal VP management for ATM nets.
Telecommun. Syst.
Sung-Jin Chung, Sung-Pil Hong, Hae-Goo Song
1999 Misc conf
A Competitive Online Algorithm for the Paging Problem with "Shelf" Memory.
COCOON
Sung-Pil Hong
1998 A* conf
An Efficient Multicast Routing Algorithm for Delay-Sensitive Applications with Dynamic Membership.
INFOCOM
Sung-Pil Hong, Heesang Lee, Bum Hwan Park
1997 — conf
Towards Real-Time Optimal Management of Virtual Paths in ATM-Based B-ISDN's.
ICC (1)
Sung-Jin Chung, Sung-Pil Hong, Hae-Goo Song, Sang-Baeg Kim
1996 J jnl
On the Complexity of the Production-Transportation Problem.
SIAM J. Optim.
Dorit S. Hochbaum, Sung-Pil Hong
1995 J jnl
A note on the strong polynomiality of convex quadratic programming.
Math. Program.
Sung-Pil Hong, Sushil Verma
1995 J jnl
About strongly polynomial time algorithms for quadratic optimization over submodular constraints.
Math. Program.
Dorit S. Hochbaum, Sung-Pil Hong