Fractional matroid matchings

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

John H. Vande Vate

Publication date: 25 June 1992

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

Full work available at URL: https://doi.org/10.1016/0095-8956(92)90037-x

zbMATH Keywords

matroid intersectionlattice polyhedron(fractional) matroid matchinglinear relacation

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Minimizing submodular functions on diamonds via generalized fractional matroid matchings, On fractional realizations of graph degree sequences, An algorithm for weighted fractional matroid matching, A Weighted Linear Matroid Parity Algorithm, On matroid parity and matching polytopes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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