Research Publication

Click here for my Google Scholar Citations

Journal Refereed Publication:

With Sunil Chopra and Dan Steffy, A concise characterization of strong knapsack facets, to appear in Discrete Applied Mathematics. Click here to download

With Sunil Chopra, Bartosz Filipecki, Kangbok Lee, Minseok Ryu and Mathieu Van Vyve, An extended formulation of the convex recoloring problem on a tree, Mathematical Programming, Ser. A, 165 (2017) 529-548.

With Sunil Chopra and Wenwei Cao, The worst case analysis of strong knapsack facets, Mathematical Programming, Ser. A, 162 (2017) 465-493.

With Eddie Cheng, Li Li, Laszlo Liptak and Daniel E. Steffy, On the problem of determining which (n, k)-star graphs are Cayley graphs, Graphs and Combinatorics 33 (2017) 85-102.

With Ellis Johnson, Cyclic group blocking polyhedra, Mathematical Programming, Ser. A, 138 (2013) 273–307.

With Yan Shu, Sunil Chopra and Ellis Johnson, Binary group facets with complete support and non-binary coefficients, Operations Research Letters 41 (2013) 679-684.

With Jozef Siran and Janez Zerovnik, Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs, Discrete Applied Mathematics 119 (2002) 281–286.

With Jin Ho Kwak, Total embedding distributions for bouquets of circles, Discrete Mathematics 248 (2002) 93–108.

Conference Proceedings:

With Sunil Chopra, Ergin Erdem and Isaac Kim. Column generation approach to the convex recoloring problem on a tree, Modeling and Optimization: Theory and Applications (MOPTA, Bethlehem, PA, USA, August 2016), Volume 213 of the series Springer Proceedings in Mathematics & Statistics, pp 39-53, 2017.

With Sunil Chopra, Kangbok Lee and Minseok Ryu, Separation Algorithm for Tree Partitioning Inequalities, Electronic Notes in Discrete Mathematics 52 (2016) 109-116.

With Sunil Chopra and Dan Steffy, A few strong knapsack facets, Modeling and Optimization: Theory and Applications (MOPTA, Bethlehem, PA, USA, August 2014), Volume 147 of the series Springer Proceedings in Mathematics & Statistics, pp 77-94, 2015.

With Wenwei Cao and Ellis Johnson, Primal-dual simplex method for shooting, Electronic Notes in Discrete Mathematics 36 (2010) 719–726.

Working Papers:

1. “A strong formulation for the partition problem” submitted. (with Sunil Chopra and Dabeen Lee) Click here to download

Poster Presentation

1. “The facets of the tree partition problem” presented at MIP 2013 in Madison, WI. Click here to download

2. “A few strong knapsack facets” presented at MIP 2014 in Columbus, OH. Click here to download

3. “Integer Programming Approach for Tree Partitioning into Subtrees” presented by Minseok Ryu at ICS 2015 in Richmond, VA. Click here to download

At RMU:

1. “Convex Recoloring Problem” Poster Presentation at the 2nd RMU R&G Expo on April 24, 2017

2. “Linear Programming Approach to Clustering a Biological Network into Connected Subnetworks” SEMS Research Highlights 3:5, June 2016

Expo Poster - Erdem-Shim.pptx

(487k)

SANGHO SHIM,

Sep 22, 2017, 8:11 AM

v.1

Integer Programming Approach for Tree Partitioning into Subtrees_ICS2015_Final.pdf

(1058k)

SANGHO SHIM,

Jan 23, 2015, 1:25 PM

v.1

LeeChopraShim_TreePartition_ForSubmission.pdf

(131k)

SANGHO SHIM,

Nov 3, 2014, 8:00 PM

v.1

YH_Submitted_ENDM.pdf

(258k)

SANGHO SHIM,

Dec 2, 2014, 6:02 AM

v.1

mip2013_Shim_newsize.pdf

(316k)

SANGHO SHIM,

Jan 23, 2015, 1:22 PM

v.1

mip2014_Shim.pdf

(524k)

SANGHO SHIM,

Jan 23, 2015, 1:25 PM

v.1