Skip to main content
Springer Nature Link
Log in

A separation algorithm for the matchable set polytope

  • Published:
Mathematical Programming Submit manuscript

Abstract

A matchable set of a graph is a set of vertices joined in pairs by disjoint edges. Balas and Pulleyblank gave a linear-inequality description of the convex hull of matchable sets. We give a polynomial-time combinatorial algorithm for the separation problem for this polytope, and a min—max theorem characterizing the maximum violation by a given point of an inequality of the system.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • E. Balas and W.R. Pulleyblank, “The perfectly matchable subgraph polyhedron of an arbitrary graph,”Combinatorica 9 (1989) 495–516.

    Google Scholar 

  • W.H. Cunningham and J. Green-Krótki, “b-matching degree-sequence polyhedra,”Combinatorica 11 (1991) 219–230.

    Google Scholar 

  • J. Edmonds, “Maximum matching and a polyhedron with 0–1 vertices,”Journal of Research of the National Bureau of Standards 69B (1965) 126–130.

    Google Scholar 

  • J. Edmonds and E.L. Johnson, “Matching: A well-solved class of integer linear programs,” in: R.K. Guy et al., eds.Combinatorial Structures and their Applications (Gordon and Breach, New York, 1970) pp. 89–92.

    Google Scholar 

  • A. Frank and E. Tardos, “An application of simultaneous Diophantine approximation in combinatorial optimization.”Combinatorica 7 (1987) 49–66.

    Google Scholar 

  • M. Grötschel, L. Lovász and A. Schrijver, “The ellipsoid method and its consequences in combinatorial optimization,”Combinatorica 1 (1981) 169–197.

    Google Scholar 

  • Q. Ning, “On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph,”Operations Research Letters 6 (1987) 239–242.

    Google Scholar 

  • M.W. Padberg and M.R. Rao, “Odd minimum cuts andb-matchings,”Mathematics of Operations Research 7 (1982) 67–80.

    Google Scholar 

  • W.R. Pulleyblank,Faces of Matching Polyhedra, Ph.D. Thesis (University of Waterloo, Ont., Canada, 1973).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    William H. Cunningham

  2. 19, rue de l'Ecole Polytechnique, 75005, Paris, France

    Jan Green-Krótki

Authors
  1. William H. Cunningham
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jan Green-Krótki
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Corresponding author. Part of this work was done while this author was visiting the Institut für Operations Research and the Forschungsinstitut für Diskrete Mathematik, Universität Bonn, Germany. Research supported by SFB303 DFG, Germany and by NSERC of Canada.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cunningham, W.H., Green-Krótki, J. A separation algorithm for the matchable set polytope. Mathematical Programming 65, 139–150 (1994). https://doi.org/10.1007/BF01581694

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01581694

Keywords

Search

Navigation