Now showing items 1-3 of 3

    • The integer knapsack cover polyhedron 

      Yaman, H. (Society for Industrial and Applied Mathematics, 2007)
      We study the integer knapsack cover polyhedron which is the convex hull of the set of vectors x ∈ ℤ+ n that satisfy C T x ≥ b, with C ∈ ℤ++ n and 6 ∈ ℤ++. We present some general results about the nontrivial facet-defining ...
    • k-node-disjoint hop-constrained survivable networks: polyhedral analysis and branch and cut 

      Diarrassouba, I.; Mahjoub, M.; Mahjoub, A. R.; Yaman, H. (Springer-Verlag France, 2018)
      Given a graph with weights on the edges, a set of origin and destination pairs of nodes, and two integers L ≥ 2 and k ≥ 2, the k-node-disjoint hop-constrained network design problem is to find a minimum weight subgraph of ...
    • Survivability in hierarchical telecommunications networks under dual homing 

      Karaşan, O. E.; Mahjoub, A. R.; Özkök, O.; Yaman, H. (Institute for Operations Research and the Management Sciences (I N F O R M S), 2014)
      The motivation behind this study is the essential need for survivability in the telecommunications networks. An optical signal should find its destination even if the network experiences an occasional fiber cut. We consider ...