Fractional matroid matchings

DOI10.1016/0095-8956(92)90037-XzbMath0806.90099MaRDI QIDQ1812954

John H. Vande Vate

Publication date: 25 June 1992

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

matroid intersection; lattice polyhedron; (fractional) matroid matching; linear relacation

Mathematics Subject Classification ID

52B12: Special polytopes (linear programming, centrally symmetric, etc.)

90C27: Combinatorial optimization

05B35: Combinatorial aspects of matroids and geometric lattices

Cites Work

• An augmenting path algorithm for linear matroid parity
• Fractional matchings and the Edmonds-Gallai theorem
• Matrices with the Edmonds-Johnson property
• Algebraic and geometric combinatorics
• On the nonsingular submatrices of the incidence matrix of a graph over the real field
• Solving the linear matroid parity problem as a sequence of matroid intersection problems
• Edmonds polytopes and a hierarchy of combinatorial problems
• Polyhedra related to a lattice
• Complexity of Matroid Property Algorithms
• Integer and Fractional Matchings
• Matroid intersection algorithms
• Properties of vertex packing and independence system polyhedra
• Matching, Euler tours and the Chinese postman
• Integer Programming: Methods, Uses, Computations
• Maximum matching and a polyhedron with 0,1-vertices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item