Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/9783
Title: Minimum rooted not-necessarily-spanning arborescence problem
Authors: Rao, V. Venkata
Sridharan, R.
Keywords: Arborescence;Lagrangian Relaxation;Acyclic Graph;Zero One Integer Programming
Issue Date: 19-Oct-2002
Description: Rao, V. Venkata and Sridharan, R (2002) Minimum rooted not-necessarily-spanning arborescence problem, Networks, Vol. 39(2), Pp. 77-87
URI: http://hdl.handle.net/11718/9783
Appears in Collections:Journal Articles

Files in This Item:
There are no files associated with this item.


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