Please use this identifier to cite or link to this item:
http://hdl.handle.net/11718/509
Full metadata record
DC Field | Value | Language |
---|---|---|
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 |
Appears in Collections: | Working Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
WP 1997_1412.pdf | 321.56 kB | Adobe PDF | View/Open |
Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.