Thumbnail Image
🆕 Date Issued:
2007
🗄 In DepositOnce:2021-12-17
Submitted Version

Please use this identifier to cite or link to this item:

Benchmarks for Strictly Fundamental Cycle Bases

Liebchen, Christian; Wünsch, Gregor; Köhler, Ekkehard; Reich, Alexander; Rizzi, Romeo

Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin

In 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.
strictly fundamental cycle basescycle bases on gridslocal searchheuristicslower and upper bounds
In Copyright
Full item page