On matroid parity and matching polytopes

DOI10.1016/J.DAM.2020.03.049zbMATH Open1443.05030OpenAlexW3013380221MaRDI QIDQ777400FDOQ777400

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

zbMATH Keywords

polyhedral combinatoricsmatroid matchingmatroid parity

Mathematics Subject Classification ID

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Matching theory
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Paths, Trees, and Flowers
• Outline of an algorithm for integer solutions to linear programs
• Maximum matching and a polyhedron with 0,1-vertices
• An algorithm for weighted fractional matroid matching
• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
• Matroids and the greedy algorithm
• Matroid matching and some applications
• Edmonds polytopes and a hierarchy of combinatorial problems
• Complexity of Matroid Property Algorithms
• A weighted linear matroid parity algorithm
• Combinatorial theory.
• Fractional matroid matchings
• 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
• Algebraic algorithms for linear matroid parity problems
• Matroid matching: the power of local search
• A Fast, Simpler Algorithm for the Matroid Parity Problem

Cited In (4)

• The parity problem of polymatroids without double circuits
• FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective
• Structural properties of matroid matchings
• Note on a matroid with parity condition

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Matching, matroids, and extensions 👍 👎
• Perfect matching and polymatroids 👍 👎
• Structural properties of matroid matchings 👍 👎
• Note on a matroid with parity condition 👍 👎
• On the graphic matroid parity problem 👍 👎
• Matching as the Intersection of Matroids 👍 👎
• Matchings and \(\Delta\)-matroids 👍 👎

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)