A new algorithm for general matching problems using network flow subproblems

DOI10.1002/net.3230190406zbMath0674.90067OpenAlexW2092921338MaRDI QIDQ3829354

Jean-Marc Rousseau, Réjean Lessard, Michel Minoux

Publication date: 1989

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230190406

zbMATH Keywords

matching polytopeminimum cost network flowblossom inequalitiesminimum cost perfect matchingactive constraint set strategy

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items (1)

A genetic-based framework for solving (multi-criteria) weighted matching problems.

Cites Work

• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: A new algorithm for general matching problems using network flow subproblems