On matroid parity and matching polytopes
From MaRDI portal
Publication:777400
DOI10.1016/j.dam.2020.03.049zbMath1443.05030OpenAlexW3013380221MaRDI QIDQ777400
Ioannis Mourtos, Adam N. Letchford, Konstantinos Kaparis
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
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (1)
Cites Work
- An algorithm for weighted fractional matroid matching
- An augmenting path algorithm for linear matroid parity
- Matching theory
- Matroid matching and some applications
- Fractional matroid matchings
- Solving the linear matroid parity problem as a sequence of matroid intersection problems
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- Edmonds polytopes and a hierarchy of combinatorial problems
- Combinatorial theory.
- Algebraic Algorithms for Linear Matroid Parity Problems
- Matroid Matching: The Power of Local Search
- Outline of an algorithm for integer solutions to linear programs
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A Fast, Simpler Algorithm for the Matroid Parity Problem
- Complexity of Matroid Property Algorithms
- A weighted linear matroid parity algorithm
- Paths, Trees, and Flowers
- A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis
- Maximum matching and a polyhedron with 0,1-vertices
- Matroids and the greedy algorithm
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On matroid parity and matching polytopes
