Exact algorithm for the uncapacitated network design problem
Abstract
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.
Collections
- Working Papers [2627]