-

 

 

 




Optimization Online





 

On Matroid Parity and Matching Polytopes

Konstantinos Kaparis (K.Kaparis***at***uom.edu.gr)
Adam Letchford (A.N.Letchford***at***lancaster.ac.uk)
Ioannis Mourtos (mourtos***at***aueb.gr)

Abstract: The matroid parity (MP) problem is a powerful (and NP-hard) extension of the matching problem. Whereas matching polytopes are well understood, little is known about MP polytopes. We prove that, when the matroid is laminar, the MP polytope is affinely congruent to a perfect b-matching polytope. From this we deduce that, even when the matroid is not laminar, every Chvatal-Gomory cut for the MP polytope can be derived as a {0,1/2}-cut from a laminar family of rank constraints. We also prove a negative result concerned with the integrality gap of two linear relaxations of the MP problem.

Keywords: matching; matroids; polyhedral combinatorics

Category 1: Combinatorial Optimization (Graphs and Matroids )

Category 2: Combinatorial Optimization (Polyhedra )

Citation: Accepted for publication in Discrete Applied Mathematics March 2020.

Download:

Entry Submitted: 03/17/2017
Entry Accepted: 03/17/2017
Entry Last Modified: 03/27/2020

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society