Browsing Shim, Sang Ho Ph.D. by Title

Browsing Shim, Sang Ho Ph.D. by Title

Sort by: Order: Results:

  • Erdem, Ergin; Johson, Christopher; shim, Sang Ho; Williams, Jordan (ASEE, 2018-06)
    We develop case study materials for the future of supply chain logistics; Truck-Drone two tier delivery network design. FedEx Headquarter (HQ) in a city was used as the networks root node or central distribution center ...
  • Chopra, Sunil; Shim, Sang Ho; Steffy, Daniel E. (Discrete Applied Mathematics, 2019-01)
    For the integer knapsack problem, the i/k -facets with dividing 6 or 8 were shown to be very strong and efficiently separated (Chopra et al., 2015; Shim et al., 2017). We give a concise characterization of the i/k -facets ...
  • Chopra, Sunil; Filipecki, Bartosz; Lee, Kangbok; Ryu, Minseok; Shim, Sang Ho; Vyve, Mathieu Van (Mathematical Programming, 2017)
    We introduce a strong extended formulation of the convex recoloring problem on a tree, which has an application in analyzing phylogenetic trees. The extended formulation has only a polynomial number of constraints, but ...
  • Cheng, Eddie; Li, Li; Liptak, Laszlo; Shim, Sang Ho; Steffy, Daniel E. (Graphs and Combinatorics, 2017)
    In this paper we work to classify which of the (n, k)-star graphs, denoted by Sn,k , are Cayley graphs. Although the complete classification is left open, we derive infinite and non-trivial classes of both Cayley and ...
  • Erdem, Ergin; Gahler, Kenneth; Kim, Eunseok; Shim, Sang Ho (ASEE, 2018)
    The convex recoloring problem is a clustering problem to partition nodes of a network into connected subnetworks. We develop a hybrid rule combining the Dantzig’s Rule and the Steepest Edge Rule to produce columns which ...
  • Shim, Sang Ho; Chopra, Sunil (Networks, 2018)
    We develop a polynomial size extended graph formulation of the graph partition problem which dominates the formulation introduced by Chopra and Rao’s study, and show that the extended graph formulation is tight on a tree. ...
  • Shim, Sang Ho; Chopra, Sunil; Cao, Wenwei (Mathematical Programming, 2017)
    In this paper we identify strong facet defining inequalities for the master knapsack polytope. Our computational experiments for small master knapsack problems show that 1 / k-facets for small values of k ( k≤4 ) are ...

Search DSpace


Advanced Search

Browse

My Account