When is the matching polytope box-totally dual integral?

Document Type

Article

Publication Date

2-1-2018

Abstract

Let G = (V,E) be a graph. The matching polytope of G, denoted by P(G), is the convex hull of the incidence vectors of all matchings in G. As proved by Edmonds [10] [Edmonds J (1965) Maximum matching and a polyhedron with 0, 1-vertices, J. Res. Nat. Bur. Standards Sect. B 69(1-2):125-130.], P(G) is determined by the following linear system n(G): x(e) >0 for each e ϵ E; x(δ(v)) ≤ 1 for each v ϵ V; and x(E[U]) ≤ [1/2\U\\ for each U ⊆ V with \U\ odd. In 1978, Cunningham and Marsh [6] [Cunningham W, Marsh A (1978) A primal algorithm for optimum matching. Balinski ML, Hoffman AJ, eds. Polyhedral combinatorics. Mathematical Programming Studies, Vol. 8 (Springer, Berlin), 50-72.] strengthened this theorem by showing that n(G) is always totally dual integral. In 1984, Edmonds and Giles [11] [Edmonds J, Giles R (1984) Total dual integrality of linear inequality systems. Progress in Combinatorial Optimization (Academic Press, Toronto), 117-129.] initiated the study of graphs G for which n(G) is box-totally dual integral. In this paper, we present a structural characterization of all such graphs, and develop a general and powerful method for establishing box-total dual integrality.

Publication Source (Journal or Book title)

Mathematics of Operations Research

First Page

64

Last Page

99

This document is currently not available here.

Plum Print visual indicator of research metrics
PlumX Metrics
  • Citations
    • Citation Indexes: 6
  • Usage
    • Abstract Views: 3
  • Captures
    • Readers: 6
see details

Share

COinS