On matroid parity and matching polytopes
DOI10.1016/J.DAM.2020.03.049zbMATH Open1443.05030OpenAlexW3013380221MaRDI QIDQ777400FDOQ777400
Authors: Konstantinos Kaparis, Adam N. Letchford, Ioannis Mourtos 
Publication date: 7 July 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/142783/1/DA11382_R1.pdf
Recommendations
- On the generalization of the matroid parity problem
- On the graphic matroid parity problem
- Matching, matroids, and extensions
- Matchings and \(\Delta\)-matroids
- scientific article; zbMATH DE number 1757951
- scientific article; zbMATH DE number 3150
- Structural properties of matroid matchings
- Note on a matroid with parity condition
- Matching as the Intersection of Matroids
- Perfect matching and polymatroids
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35)
Cites Work
- Matching theory
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Paths, Trees, and Flowers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Outline of an algorithm for integer solutions to linear programs
- Maximum matching and a polyhedron with 0,1-vertices
- Title not available (Why is that?)
- An algorithm for weighted fractional matroid matching
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- Title not available (Why is that?)
- Matroids and the greedy algorithm
- Matroid matching and some applications
- Edmonds polytopes and a hierarchy of combinatorial problems
- Title not available (Why is that?)
- Complexity of Matroid Property Algorithms
- A weighted linear matroid parity algorithm
- Combinatorial theory.
- Fractional matroid matchings
- Title not available (Why is that?)
- Title not available (Why is that?)
- An augmenting path algorithm for linear matroid parity
- Solving the linear matroid parity problem as a sequence of matroid intersection problems
- A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis
- Title not available (Why is that?)
- Algebraic algorithms for linear matroid parity problems
- Matroid matching: the power of local search
- A Fast, Simpler Algorithm for the Matroid Parity Problem
- Title not available (Why is that?)
Cited In (7)
- Matroid Parity and Jump Systems: A Solution to a Conjecture of Recski
- The parity problem of polymatroids without double circuits
- Title not available (Why is that?)
- FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective
- A note on the separation problem for the matching matroid
- Structural properties of matroid matchings
- Note on a matroid with parity condition
This page was built for publication: On matroid parity and matching polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q777400)
