Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs. - Sangho Shim; Jozef Sirán; Janez Zerovnik (Discret. Appl. Math., 2002)

Large scale group network optimization. - Sangho Shim (2009)

Primal-dual simplex method for shooting. - Sangho Shim; Ellis L. Johnson; Wenwei Cao (Electron. Notes Discret. Math., 2010)

Cyclic group blocking polyhedra. - Sangho Shim; Ellis L. Johnson (Math. Program., 2013)

Binary group facets with complete support and non-binary coefficients. - Yan Shu; Sunil Chopra; Ellis L. Johnson; Sangho Shim (Oper. Res. Lett., 2013)

Separation Algorithm for Tree Partitioning Inequalities. - Sunil Chopra; Kangbok Lee; Minseok Ryu; Sangho Shim (Electron. Notes Discret. Math., 2016)

On the Problem of Determining which (n, k)-Star Graphs are Cayley Graphs. - Eddie Cheng 001; Li Li 018; László Lipták; Sangho Shim; Daniel E. Steffy (Graphs Comb., 2017)

An extended formulation of the convex recoloring problem on a tree. - Sunil Chopra; Bartosz Filipecki; Kangbok Lee; Minseok Ryu; Sangho Shim; Mathieu Van Vyve (Math. Program., 2017)

The worst case analysis of strong knapsack facets. - Sangho Shim; Sunil Chopra; Wenwei Cao (Math. Program., 2017)

A concise characterization of strong knapsack facets. - Sunil Chopra; Sangho Shim; Daniel E. Steffy (Discret. Appl. Math., 2019)

A strong formulation for the graph partition problem. - Sunil Chopra; Sangho Shim (Networks, 2020)

Park-and-Ride Facility Location Under Nested Logit Demand Function. - Sang Hyun Kim; Sangho Shim (CoRR, 2021)

Extended Graph Formulation for the Inequity Aversion Pricing Problem on Social Networks. - Sunil Chopra; Hyunwoo Park; Sangho Shim (INFORMS J. Comput., 2022)

Redrawing the 2012 map of the Maryland congressional districts. - Noah Lee; Hyunwoo Park; Sangho Shim (CoRR, 2023)

Parallel Power System Restoration. - Sunil Chopra; Feng Qiu; Sangho Shim (INFORMS J. Comput., 2023)

An Exact Solution Method for the Political Districting Problem. - Sunil Chopra; Hyunwoo Park; Sangho Shim (Parallel Process. Lett., 2023)