Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/509
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSastry, Trilochan-
dc.date.accessioned2009-12-12T06:41:23Z-
dc.date.available2009-12-12T06:41:23Z-
dc.date.copyright1997-11-
dc.date.issued2009-12-12T06:41:23Z-
dc.identifier.urihttp://hdl.handle.net/11718/509-
dc.description.abstractWe 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.isoenen
dc.relation.ispartofseriesWP;1412-
dc.subjectNetwork designen
dc.subjectAlgorithmen
dc.titleExact algorithm for the uncapacitated network design problemen
dc.typeWorking Paperen
Appears in Collections:Working Papers

Files in This Item:
File Description SizeFormat 
WP 1997_1412.pdf321.56 kBAdobe PDFView/Open


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.