Efficient edge-swapping heuristics for finding minimum fundamental cycle bases

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3059, Issue , 2004, Pages 14-29

  Amaldi, Edoardo ^a   Liberti, Leo ^a   Maculan, Nelson ^b   Maffioli, Francesco ^b  

^a POLITECNICO DI MILANO   (Italy)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ITERATIVE METHODS; TELECOMMUNICATION NETWORKS;

COMPUTATIONAL RESULTS; FUNDAMENTAL CYCLES; LINEAR RELAXATIONS; LOCAL SEARCH; LOWER BOUNDS; META HEURISTICS; MIXED INTEGER PROGRAMMING; SPANNING TREE;

INTEGER PROGRAMMING;

EID: 33751311372     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24838-5_2     Document Type: Article

References (17)

1. Syslo, M.: On some problems related to fundamental cycle sets of a graph. In Chartrand, R., ed.: Theory of Applications of Graphs, New York, Wiley (1981) 577-588
2. Kirchhoff, G.: Über die auflösung der gleichungen, auf welche man bei der Untersuchungen der linearen Verteilung galvanisher ströme geführt wird. Poggendorf Annalen Physik 72 (1847) 497-508
3. Syslo, M.: On cycle bases of a graph. Networks 9 (1979) 123-132
4. Syslo, M.: On the fundamental cycle set graph. IEEE Transactions on Circuits and Systems 29 (1982) 136-138
5. Horton, J.: A polynomial-time algorithm to find the shortest cycle basis of a graph. SIAM Journal of Computing 16 (1987) 358-366
6. Amaldi, E., Rizzi, R.: Personal communication. (2003)
7. Deo, N., Prabhu, G., Krishnamoorthy, M.: Algorithms for generating fundamental cycles in a graph. ACM Transactions on Mathematical Software 8 (1982) 26-42
8. Galbiati, G., Amaldi, E.: On the approximability of the minimum fundamental cycle basis problem. In Jansen, K., Solis-Oba, R., eds.: Approximation and Online Algorithms: First international workshop WAOA 2003, Lecture Notes in Computer Science. Volume 1909., Springer-Verlag (2004) 151-164
9. Brambilla, A., Premoli, A.: Rigorous event-driven (RED) analysis of large-scale nonlinear RC circuits. IEEE Transactions on Circuits and Systems-I: Fundamental Theory and Applications 48 (2001) 938-946
10. Liebchen, C., Möhring, R.H.: A case study in periodic timetabling. In Wagner, D., ed.: Electronic Notes in Theoretical Computer Science. Volume 66., Elsevier (2002)
11. Deo, N., Kumar, N., Parsons, J.: Minimum-length fundamental-cycle set problem: New heuristics and an empirical investigation. Congressus Numerantium 107 (1995) 141-154
12. Paton, K.: An algorithm for finding a fundamental set of cycles of a graph. Communications of the ACM 12 (1969) 514-518
13. Shioura, A., Tamura, A., Uno, T.: An optimal algorithm for scanning all spanning trees of undirected graphs. SIAM Journal of Computing 26 (1997) 678-692
14. Hansen, P-, Mladenović, N.: Variable neighbourhood search. In Glover, F., Kochenberger, G., eds.: Handbook of Metaheuristics, Dordrecht, Kluwer (2003)
15. Hertz, A., Taillard, E., de Werra, D.: Tabu search. In Aarts, E., Lenstra, J., eds.: Local Search in Combinatorial Optimization, Chichester, Wiley (1997) 121-136
16. Liberti, L., Amaldi, E., Maculan, N., Maffioli, F.: Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases. Submitted to Yugoslav Journal of Operations Research (2003)
17. Serafini, P., Ukovich, W.: A mathematical model for periodic scheduling problems.