Bounds for 3-matroid intersection problems

DOI10.1016/0020-0190(75)90021-6MaRDI QIDQ1218336zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3532755 (Why is no real title available?)
• scientific article; zbMATH DE number 3561089 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3326386 (Why is no real title available?)
• Technical Note—Bounds for the Travelling-Salesman Problem
• The traveling-salesman problem and minimum spanning trees: Part II

Cited in

(1)

• Heuristically guided algorithm for k-parity matroid problems

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

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