paper

On a class of strong valid inequalities for the connected matching polytope

arXiv:2309.14019

Abstract

We identify a family of nontrivial facets of the connected matching polytope of a graph , that is, the convex hull of incidence vectors of matchings in whose covered vertices induce a connected subgraph. Accompanying software to further inspect the polytope of an input graph is available.

8 pages, 1 figure. Submitted for publication

Cited by in corpus (1)

On a class of strong valid inequalities for the connected matching polytope · wovepaper