Show simple item record

dc.contributor.authorRao, V. Venkata
dc.contributor.authorSridharan, R.
dc.date.accessioned2010-10-19T08:57:12Z
dc.date.available2010-10-19T08:57:12Z
dc.date.copyright2002
dc.date.issued2002-10-19T08:57:12Z
dc.identifier.urihttp://hdl.handle.net/11718/9783
dc.descriptionRao, V. Venkata and Sridharan, R (2002) Minimum rooted not-necessarily-spanning arborescence problem, Networks, Vol. 39(2), Pp. 77-87en
dc.language.isoenen
dc.subjectArborescenceen
dc.subjectLagrangian Relaxationen
dc.subjectAcyclic Graphen
dc.subjectZero One Integer Programmingen
dc.titleMinimum rooted not-necessarily-spanning arborescence problemen
dc.typeArticleen


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record