| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Myoung-Ju Park, Sung-Pil Hong |
Rank of Handelman hierarchy for Max-Cut.  |
Oper. Res. Lett.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Junho Chang, Soo Y. Chang, Sung-Pil Hong, Yun-Hong Min, Myoung-Ju Park |
Approximation of a batch consolidation problem.  |
Networks  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sung-Pil Hong, Myoung-Ju Park, Soo Y. Chang |
Approximation of the k-batch consolidation problem.  |
Theor. Comput. Sci.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sung-Pil Hong, Sung-Jin Cho, Myoung-Ju Park |
A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search.  |
European Journal of Operational Research  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sung-Pil Hong, Sung-Jin Cho, Myoung-Ju Park, Moon-Gul Lee |
Optimal search-relocation trade-off in Markovian-target searching.  |
Computers & OR  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sung-Pil Hong, Yong-Hyuk Kim |
A genetic algorithm for joint replenishment based on the exact inventory cost.  |
Computers & OR  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sung-Pil Hong, Levent Tunçel |
Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra.  |
Discrete Applied Mathematics  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sung-Pil Hong, Byung-Cheon Choi |
Polynomiality of sparsest cuts with fixed number of sources.  |
Oper. Res. Lett.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Sung-Pil Hong, Byung-Cheon Choi |
Approximability of the k-server disconnection problem.  |
Networks  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Youngkyu Choi, Sunghyun Choi, Sung-Pil Hong |
Connection-level QoS provisioning in multiple transmission technology-based OFDM system.  |
WiOpt  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Byung-Cheon Choi, Sung-Pil Hong |
Two-Server Network Disconnection Problem.  |
ICCSA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Sung-Pil Hong, Sung-Jin Chung, Bum Hwan Park |
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.  |
Oper. Res. Lett.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Sung-Jin Chung, Sung-Pil Hong, Hae-Goo Song |
Towards real-time optimal VP management for ATM nets.  |
Telecommunication Systems  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Sung-Pil Hong |
A Competitive Online Algorithm for the Paging Problem with "Shelf" Memory.  |
COCOON  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Sung-Pil Hong, Heesang Lee, Bum Hwan Park |
An Efficient Multicast Routing Algorithm for Delay-Sensitive Applications with Dynamic Membership.  |
INFOCOM  |
1998 |
DBLP BibTeX RDF |
|
| 1 | Sung-Jin Chung, Sung-Pil Hong, Hae-Goo Song, Sang-Baeg Kim |
Towards Real-Time Optimal Management of Virtual Paths in ATM-Based B-ISDN's.  |
ICC  |
1997 |
DBLP BibTeX RDF |
|
| 1 | Dorit S. Hochbaum, Sung-Pil Hong |
About strongly polynomial time algorithms for quadratic optimization over submodular constraints.  |
Math. Program.  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Sung-Pil Hong, Sushil Verma |
A note on the strong polynomiality of convex quadratic programming.  |
Math. Program.  |
1995 |
DBLP DOI BibTeX RDF |
|