Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Seiji Kataoka, Norio Araki, Takeo Yamada. Upper and lower bounding procedures for minimum rooted k-subtree problem. European Journal of Operational Research, 122(3):561-569, 2000. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Upper and lower bounding procedures for the multiple knapsack assignment problemSeiji Kataoka, Takeo Yamada. eor, 237(2):440-447, 2014. [doi]
The following publications are possibly variants of this publication: