The minimum fundamental cycle basic problem: a new heuristic based on edge swaps

MaRDI QIDQ4899827zbMATH OpenFDO

Authors E. Amaldi, Leo Liberti, Francesco Maffioli, Nelson Maculan

Publication date 10 January 2013

zbMATH Keywords

local searchspanning treeedge swap

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99)

Recommendations

• Algorithms for finding minimum fundamental cycle bases in graphs
• Edge-swapping algorithms for the minimum fundamental cycle basis problem
• Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases
• Minimum cycle bases for network graphs
• scientific article; zbMATH DE number 1145916

Cited in

(3)

• Edge-swapping algorithms for the minimum fundamental cycle basis problem
• Algorithms for finding minimum fundamental cycle bases in graphs
• Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases

This page was built for publication: The minimum fundamental cycle basic problem: a new heuristic based on edge swaps

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