Liebchen, ChristianWünsch, GregorKöhler, EkkehardReich, AlexanderRizzi, Romeo2021-12-172021-12-1720072197-8085https://depositonce.tu-berlin.de/handle/11303/15625http://dx.doi.org/10.14279/depositonce-14398In the Minimum Strictly Fundamental Cycle Basis (MSFCB) problem one is looking for a spanning tree such that the sum of the lengths of its induced fundamental circuits is minimum.en510 Mathematikstrictly fundamental cycle basescycle bases on gridslocal searchheuristicslower and upper boundsResearch Paper