Bounds for 3-matroid intersection problems

DOI10.1016/0020-0190(75)90021-6zbMath0307.90052OpenAlexW2049401465MaRDI QIDQ1218336

Paolo M. Camerini, Francesco Maffioli

Publication date: 1975

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(75)90021-6

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (1)

Heuristically guided algorithm for k-parity matroid problems

Cites Work

• The traveling-salesman problem and minimum spanning trees: Part II
• Technical Note—Bounds for the Travelling-Salesman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounds for 3-matroid intersection problems