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

DOI10.2298/YJOR0501015LzbMATH Open1274.90462OpenAlexW1976529326MaRDI QIDQ4928243FDOQ4928243

Authors: Leo Liberti, E. Amaldi, Francesco Maffioli 

Publication date: 10 June 2013

Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/yjor0501015l

Recommendations

• Algorithms for finding minimum fundamental cycle bases in graphs
• The minimum fundamental cycle basic problem: a new heuristic based on edge swaps
• Edge-swapping algorithms for the minimum fundamental cycle basis problem
• Minimum cycle bases for network graphs
• An improved heuristic for computing short integral cycle bases

zbMATH Keywords

fundamental cycleIP formulationtree-growing heuristic

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cited In (8)

• An improved heuristic for computing short integral cycle bases
• Edge-swapping algorithms for the minimum fundamental cycle basis problem
• On the approximability of the minimum strictly fundamental cycle basis problem
• Algorithms for finding minimum fundamental cycle bases in graphs
• Minimum weakly fundamental cycle bases are hard to find
• Reformulations in Mathematical Programming: Definitions and Systematics
• Lower bounds for strictly fundamental cycle bases in grid graphs
• The minimum fundamental cycle basic problem: a new heuristic based on edge swaps

This page was built for publication: Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928243)