Heuristics for the K-Cardinality Tree and Subgraph Problems

摘要: In this paper we consider the problem of finding in a given graph minimal weight subtree connected subgraph, which has number edges. These NP-hard combinatorial optimization problems have various applications oil industry, facility layout and partitioning. We will present different heuristic approaches based on spanning tree shortest path methods an exact algorithm solving polynomial time if underlying is tree. Both edge- node weighted case are investigated extensive numerical results behaviour heuristics compared to optimal solutions presented. The best yielded within error margin less than one percent from optimality for most cases. large percentage tests even been found.