Amaldi, Edoardo; Liberti, Leo; Maffioli, Francesco; … - In: Mathematical Methods of Operations Research 69 (2009) 2, pp. 205-233
We consider the problem of finding a fundamental cycle basis with minimum total cost in an undirected graph. This problem is NP-hard and has several interesting applications. Since fundamental cycle bases correspond to spanning trees, we propose a local search algorithm, a tabu search and...
