Login / Signup

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

Seiji KataokaNorio ArakiTakeo Yamada
Published in: Eur. J. Oper. Res. (2000)
Keyphrases
  • upper bound
  • tree structure
  • multiscale
  • genetic algorithm
  • artificial intelligence
  • clustering algorithm
  • digital libraries
  • simulated annealing
  • partial order
  • spanning tree
  • tree nodes
  • maximum distance