Revisiting dynamic programming for finding optimal subtrees in trees

This publication has 12 references indexed in Scilit:

• Variable neighborhood search for the vertex weighted k-cardinality tree problem
  European Journal of Operational Research, 2006
• New metaheuristic approaches for the edge-weighted k-cardinality tree problem
  Computers & Operations Research, 2005
• Metaheuristics in combinatorial optimization
  ACM Computing Surveys, 2003
• Local search algorithms for the k-cardinality tree problem
  Discrete Applied Mathematics, 2003
• Integer programming approaches tofacilities layout models with forbidden areas
  Annals of Operations Research, 1998
• Decomposing Matrices into Blocks
  SIAM Journal on Optimization, 1998
• AnO(logk)-approximation algorithm for thek minimum spanning tree problem in the plane
  Algorithmica, 1997
• Spanning Trees—Short or Small
  SIAM Journal on Discrete Mathematics, 1996
• Weighted k‐cardinality trees: Complexity and polyhedral structure
  Networks, 1994
• On the shortest spanning subtree of a graph and the traveling salesman problem
  Proceedings of the American Mathematical Society, 1956