Exact algorithm for the uncapacitated network design problem

dc.contributor.author	Sastry, Trilochan
dc.date.accessioned	2009-12-12T06:41:23Z
dc.date.available	2009-12-12T06:41:23Z
dc.date.copyright	1997-11
dc.date.issued	2009-12-12T06:41:23Z
dc.identifier.uri	http://hdl.handle.net/11718/509
dc.description.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.	en
dc.language.iso	en	en
dc.relation.ispartofseries	WP;1412
dc.subject	Network design	en
dc.subject	Algorithm	en
dc.title	Exact algorithm for the uncapacitated network design problem	en
dc.type	Working Paper	en