Upper and lower bounding procedures for minimum rooted k-subtree problem

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]

@article{KataokaAY00,
  title = {Upper and lower bounding procedures for minimum rooted k-subtree problem},
  author = {Seiji Kataoka and Norio Araki and Takeo Yamada},
  year = {2000},
  doi = {10.1016/S0377-2217(99)00092-2},
  url = {http://dx.doi.org/10.1016/S0377-2217(99)00092-2},
  researchr = {https://researchr.org/publication/KataokaAY00},
  cites = {0},
  citedby = {0},
  journal = {European Journal of Operational Research},
  volume = {122},
  number = {3},
  pages = {561-569},
}