Mathematical Programming

, Volume 33, Issue 3, pp 243–259

Solving matching problems with linear programming

  • M. Grötschel
  • O. Holland

DOI: 10.1007/BF01584376

Cite this article as:
Grötschel, M. & Holland, O. Mathematical Programming (1985) 33: 243. doi:10.1007/BF01584376


In this paper we describe an implementation of a cutting plane algorithm for the perfect matching problem which is based on the simplex method. The algorithm has the following features:
  • -It works on very sparse subgraphs ofKn which are determined heuristically, global optimality is checked using the reduced cost criterion.

  • -Cutting plane recognition is usually accomplished by heuristics. Only if these fail, the Padberg-Rao procedure is invoked to guarantee finite convergence.

Our computational study shows that—on the average—very few variables and very few cutting planes suffice to find a globally optimal solution. We could solve this way matching problems on complete graphs with up to 1000 nodes. Moreover, it turned out that our cutting plane algorithm is competitive with the fast combinatorial matching algorithms known to date.

Key words

MatchingLinear ProgrammingCutting Plane AlgorithmsComputational Study

Copyright information

© The Mathematical Programming Society, Inc. 1985

Authors and Affiliations

  • M. Grötschel
    • 1
  • O. Holland
    • 2
  1. 1.Lehstuhl für Angewandte Mathematik IIUniversität AugsburgAugsburgFR Germany
  2. 2.Institut für Ökonometrie und Operations ResearchUniversität BonnBonnFR Germany