An Exact Algorithm for the Uncapacitated Network Design Problem
Research & Publications
An Exact Algorithm for the Uncapacitated Network Design Problem
01/11/1997
An Exact Algorithm for the Uncapacitated Network Design Problem
Sastry Trilochan
Working Papers
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.