Now showing items 1-2 of 2

    • Exact algorithm for the uncapacitated network design problem 

      Sastry, Trilochan (2009-12-12)
      We describe an O(n22k + n3k) algorithm for the uncapacitated network design problem where K is the number of commodities, and n the number of nodes in the graph.
    • Two commodity network design: the convex hull 

      Sastry, Trilochan (2010-04-01)
      We study the uncapacitated and capacitated one facility versions of the two commodity network design problem. We characterize optimal solutions and show that we can restrict the search for optimal solutions to feasible ...