A matroid view of key theorems for edge-swapping algorithms

DOI10.1007/s00186-012-0392-7zbMath1272.90107OpenAlexW2006314097MaRDI QIDQ1935946

Leo Liberti, Jon Lee

Publication date: 20 February 2013

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

Full work available at URL: https://doi.org/10.1007/s00186-012-0392-7

zbMATH Keywords

binary matroidedge swappingfundamental circuit

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Cycle-based formulations in distance geometry, A cycle-based formulation for the distance geometry problem

Cites Work

• Edge-swapping algorithms for the minimum fundamental cycle basis problem
• Unnamed Item