Sangho Shim

According to our database1, Sangho Shim authored at least 11 papers between 2002 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
A strong formulation for the graph partition problem.
Networks, 2020

2019
A concise characterization of strong knapsack facets.
Discret. Appl. Math., 2019

2017
The worst case analysis of strong knapsack facets.
Math. Program., 2017

An extended formulation of the convex recoloring problem on a tree.
Math. Program., 2017

On the Problem of Determining which (n, k)-Star Graphs are Cayley Graphs.
Graphs Comb., 2017

2016
Separation Algorithm for Tree Partitioning Inequalities.
Electron. Notes Discret. Math., 2016

2013
Binary group facets with complete support and non-binary coefficients.
Oper. Res. Lett., 2013

Cyclic group blocking polyhedra.
Math. Program., 2013

2010
Primal-dual simplex method for shooting.
Electron. Notes Discret. Math., 2010

2009
Large scale group network optimization.
PhD thesis, 2009

2002
Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs.
Discret. Appl. Math., 2002


  Loading...