Heuristically guided algorithm for k-parity matroid problems

DOI10.1016/0012-365X(78)90083-3zbMath0416.05024MaRDI QIDQ754224

Francesco Maffioli, Paolo M. Camerini

Publication date: 1978

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

shortest pathtravelling salesman problemsinksourceweighted matroid intersectionweighted acyclic digraphweighted k-parity matroid problem

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Paroids: A canonical format for combinatorial optimization ⋮ In memoriam Paolo M. Camerini

Cites Work

• Bounds for 3-matroid intersection problems
• Matroid intersection algorithms
• Validation of subgradient optimization
• Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
• The traveling-salesman problem and minimum spanning trees: Part II
• Matroids and the greedy algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Heuristically guided algorithm for k-parity matroid problems