default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSung-Pil Hong
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j18]Seho Yim
, Sung-Pil Hong, Myoung-Ju Park, Yerim Chung:
Inverse interval scheduling via reduction on a single machine. Eur. J. Oper. Res. 303(2): 541-549 (2022)- [i1]Max Kapur, Sung-Pil Hong:
The College Application Problem. CoRR abs/2205.01869 (2022) - 2021
- [j17]Sung-Pil Hong, Kyung Min Kim, Suk-Joon Ko:
Estimating heterogeneous agent preferences by inverse optimization in a randomized nonatomic game. Ann. Oper. Res. 307(1): 207-228 (2021)
2010 – 2019
- 2013
- [j16]Bum Hwan Park, Yong-Il Seo, Sung-Pil Hong, Hag-Lae Rho:
Column Generation Approach to Line Planning with Various Halting Patterns - Application to the Korean High-Speed Railway. Asia Pac. J. Oper. Res. 30(4) (2013) - [j15]Myoung-Ju Park, Sung-Pil Hong:
Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications. J. Glob. Optim. 56(2): 727-736 (2013) - 2011
- [j14]Junho Chang, Soo Y. Chang, Sung-Pil Hong, Yun-Hong Min, Myoung-Ju Park:
Approximation of a batch consolidation problem. Networks 58(1): 12-19 (2011) - [j13]Myoung-Ju Park, Sung-Pil Hong:
Rank of Handelman hierarchy for Max-Cut. Oper. Res. Lett. 39(5): 323-328 (2011)
2000 – 2009
- 2009
- [j12]Sung-Pil Hong, Yong-Hyuk Kim:
A genetic algorithm for joint replenishment based on the exact inventory cost. Comput. Oper. Res. 36(1): 167-175 (2009) - [j11]Sung-Pil Hong, Sung-Jin Cho, Myoung-Ju Park, Moon-Gul Lee:
Optimal search-relocation trade-off in Markovian-target searching. Comput. Oper. Res. 36(6): 2097-2104 (2009) - [j10]Sung-Pil Hong, Sung-Jin Cho, Myoung-Ju Park:
A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search. Eur. J. Oper. Res. 193(2): 351-364 (2009) - [j9]Sung-Pil Hong, Myoung-Ju Park, Soo Y. Chang:
Approximation of the k-batch consolidation problem. Theor. Comput. Sci. 410(8-10): 963-967 (2009) - 2008
- [j8]Sung-Pil Hong, Levent Tunçel:
Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra. Discret. Appl. Math. 156(1): 25-41 (2008) - 2007
- [j7]Sung-Pil Hong, Byung-Cheon Choi:
Approximability of the k-server disconnection problem. Networks 50(4): 273-282 (2007) - [j6]Sung-Pil Hong, Byung-Cheon Choi:
Polynomiality of sparsest cuts with fixed number of sources. Oper. Res. Lett. 35(6): 739-742 (2007) - 2006
- [c5]Byung-Cheon Choi, Sung-Pil Hong:
Two-Server Network Disconnection Problem. ICCSA (3) 2006: 785-792 - [c4]Youngkyu Choi, Sunghyun Choi, Sung-Pil Hong:
Connection-level QoS provisioning in multiple transmission technology-based OFDM system. WiOpt 2006: 97-106 - 2004
- [j5]Sung-Pil Hong, Sung-Jin Chung, Bum Hwan Park:
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. Oper. Res. Lett. 32(3): 233-239 (2004) - 2000
- [j4]Sung-Jin Chung, Sung-Pil Hong, Hae-Goo Song:
Towards real-time optimal VP management for ATM nets. Telecommun. Syst. 14(1-4): 219-242 (2000)
1990 – 1999
- 1999
- [c3]Sung-Pil Hong:
A Competitive Online Algorithm for the Paging Problem with "Shelf" Memory. COCOON 1999: 400-408 - 1998
- [c2]Sung-Pil Hong, Heesang Lee, Bum Hwan Park:
An Efficient Multicast Routing Algorithm for Delay-Sensitive Applications with Dynamic Membership. INFOCOM 1998: 1433-1440 - 1997
- [c1]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 (1) 1997: 225-230 - 1996
- [j3]Dorit S. Hochbaum, Sung-Pil Hong:
On the Complexity of the Production-Transportation Problem. SIAM J. Optim. 6(1): 250-264 (1996) - 1995
- [j2]Sung-Pil Hong, Sushil Verma:
A note on the strong polynomiality of convex quadratic programming. Math. Program. 68: 131-139 (1995) - [j1]Dorit S. Hochbaum, Sung-Pil Hong:
About strongly polynomial time algorithms for quadratic optimization over submodular constraints. Math. Program. 69: 269-309 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
