default search action
Sangho Shim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j13]Sunil Chopra
, Feng Qiu, Sangho Shim
Parallel Power System Restoration. INFORMS J. Comput. 35(1): 233-247 (2023) - [j12]Sunil Chopra
An Exact Solution Method for the Political Districting Problem. Parallel Process. Lett. 33(1&2): 2340001:1-2340001:13 (2023) - [i3]Noah Lee, Hyunwoo Park, Sangho Shim:
Redrawing the 2012 map of the Maryland congressional districts. CoRR abs/2312.03901 (2023) - 2022
- [j11]Sunil Chopra
Extended Graph Formulation for the Inequity Aversion Pricing Problem on Social Networks. INFORMS J. Comput. 34(3): 1327-1344 (2022) - [i2]Sunil Chopra
Parallel Power System Restoration. CoRR abs/2204.01837 (2022) - 2021
- [i1]Sang Hyun Kim, Sangho Shim:
Park-and-Ride Facility Location Under Nested Logit Demand Function. CoRR abs/2111.09522 (2021) - 2020
- [j10]Sunil Chopra
A strong formulation for the graph partition problem. Networks 75(2): 183-202 (2020)
2010 – 2019
- 2019
- [j9]Sunil Chopra
A concise characterization of strong knapsack facets. Discret. Appl. Math. 253: 136-152 (2019) - 2017
- [j8]Eddie Cheng
On the Problem of Determining which (n, k)-Star Graphs are Cayley Graphs. Graphs Comb. 33(1): 85-102 (2017) - [j7]Sangho Shim, Sunil Chopra
The worst case analysis of strong knapsack facets. Math. Program. 162(1-2): 465-493 (2017) - [j6]Sunil Chopra
An extended formulation of the convex recoloring problem on a tree. Math. Program. 165(2): 529-548 (2017) - 2016
- [j5]Sunil Chopra
Separation Algorithm for Tree Partitioning Inequalities. Electron. Notes Discret. Math. 52: 109-116 (2016) - 2013
- [j4]Sangho Shim, Ellis L. Johnson:
Cyclic group blocking polyhedra. Math. Program. 138(1-2): 273-307 (2013) - [j3]Yan Shu, Sunil Chopra
Binary group facets with complete support and non-binary coefficients. Oper. Res. Lett. 41(6): 679-684 (2013) - 2010
- [j2]Sangho Shim, Ellis L. Johnson, Wenwei Cao:
Primal-dual simplex method for shooting. Electron. Notes Discret. Math. 36: 719-726 (2010)
2000 – 2009
- 2009
- [b1]Sangho Shim:
Large scale group network optimization. Georgia Institute of Technology, Atlanta, GA, USA, 2009 - 2002
- [j1]Sangho Shim, Jozef Sirán, Janez Zerovnik
Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs. Discret. Appl. Math. 119(3): 281-286 (2002)
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-07-08 21:29 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: