Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases

Yugoslav Journal of Operations Research

Volumn 15, Issue 1, 2005, Pages 15-24

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

^a POLITECNICO DI MILANO   (Italy)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Cycle basis; Fundamental cycle; IP formulation; Tree growing heuristic

Indexed keywords

EID: 59149087702     PISSN: 03540243     EISSN: 23346043     Source Type: Journal    
DOI: 10.2298/YJOR0501015L     Document Type: Article

References (16)

1. Amaldi, E., and Rizzi, R., Personal communication, 2003.
2. Brambilla, A., and 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 (8) (2001) 938-946.
3. Deo, N., Kumar, N., and Parsons, J., "Minimum-length fundamental-cycle set problem: New heuristics and an empirical investigation", Congressus Numerantium, 107 (1995) 141-154.
4. Deo, N., Prabhu, G.M., and Krishnamoorthy, M.S., "Algorithms for generating fundamental cycles in a graph", ACM Transactions on Mathematical Software, 8(1) (1982) 26-42.
5. Galbiati, G., and Amaldi, E., "On the approximability of the minimum fundamental cycle basis problem", Workshop on Approximation and Online Algorithms (WAOA03), Budapest, September 2003.
6. Horton, J.D., "A polynomial-time algorithm to find the shortest cycle basis of a graph", SIAM Journal of Computing, 16(2) (1987) 358-366.
7. Hubicka, E., and Sysło, M., "Minimal bases of cycles of a graph", in: Recent Advances in Graph Theory, 2nd Czech Symposium in Graph Theory, Academia, 1975, 283-293.
8. 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.
9. Liebchen, C., and Möhring, R.H., "A case study in periodic timetabling", in: D. Wagner (ed), Electronic Notes in Theoretical Computer Science, Volume 66. Elsevier, 2002.
10. Paton, K., "An algorithm for finding a fundamental set of cycles of a graph", Communications of the ACM, 12(9) (1969) 514-518, 1969.
11. Seshu, S., and Reed, M.B., Linear Graphs and Electrical Networks. Addison-Wesley, Reading, MA, 1961.
12. Sysło, M., "An efficient cycle vector space algorithm for listing all cycles of a planar graph", Colloquia Mathematica Societatis János Bolyai, 1978, 749-762.
13. Sysło, M., "On cycle bases of a graph", Networks, 9 (1979) 123-132.
14. Sysło, M., "On some problems related to fundamental cycle sets of a graph", in: R. Chartrand (ed.), Theory of Applications of Graphs, Wiley, New York, 1981, 577-588.
15. Sysło, M., "On some problems related to fundamental cycle sets of a graph: Research notes", Discrete Mathematics (Banach Centre Publications, Warsaw), 7 (1982) 145-157.
16. Sysło, M., "On the fundamental cycle set graph", IEEE Transactions on Circuits and Systems, 29(3) (1982) 136-138.