Minimum rooted not-necessarily-spanning arborescence problem
dc.contributor.author | Rao, V. Venkata | |
dc.contributor.author | Sridharan, R. | |
dc.date.accessioned | 2010-10-19T08:57:12Z | |
dc.date.available | 2010-10-19T08:57:12Z | |
dc.date.copyright | 2002 | |
dc.date.issued | 2002-10-19T08:57:12Z | |
dc.identifier.uri | http://hdl.handle.net/11718/9783 | |
dc.description | Rao, V. Venkata and Sridharan, R (2002) Minimum rooted not-necessarily-spanning arborescence problem, Networks, Vol. 39(2), Pp. 77-87 | en |
dc.language.iso | en | en |
dc.subject | Arborescence | en |
dc.subject | Lagrangian Relaxation | en |
dc.subject | Acyclic Graph | en |
dc.subject | Zero One Integer Programming | en |
dc.title | Minimum rooted not-necessarily-spanning arborescence problem | en |
dc.type | Article | en |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |
This item appears in the following Collection(s)
-
Journal Articles [3713]
Journal Article of IIMA