- Heuristik (1) (remove)
- Minimum Fundamental Cut Basis Problem (2005)
- Any tree in an undirected graph defines a fundamental cut basis. The minimum fundamental cut basis problem is to find a tree minimizing the weight of the corresponding basis. This problem is NP, in the thesis heuristics, relaxations, and numerical results are presented.