This thesis present two new heuristics which utilize classification and max-flow algorithm respectively to derive near-optimal branch-decompositions for linear matroids. In the literature, there are already excellent ...