Solving matching problems with linear programming

This publication has 12 references indexed in Scilit:

• A Cutting Plane Algorithm for the Linear Ordering Problem
  Operations Research, 1984
• An analysis of alternative strategies for implementing matching algorithms
  Networks, 1983
• Weakly bipartite graphs and the Max-cut problem
  Operations Research Letters, 1981
• The ellipsoid method and its consequences in combinatorial optimization
  Combinatorica, 1981
• Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
  Management Science, 1980
• Assignment and Matching Problems: Solution Methods with FORTRAN-Programs
  Published by Springer Nature ,1980
• A primal algorithm for optimum matching
  Published by Springer Nature ,1978
• Maximum matching and a polyhedron with 0,1-vertices
  Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
• Paths, Trees, and Flowers
  Canadian Journal of Mathematics, 1965
• A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
  Canadian Journal of Mathematics, 1957