An efficient algorithm for the bipartite matching problem

DOI10.1016/0377-2217(86)90218-3zbMath0582.90103OpenAlexW2095226349MaRDI QIDQ1069866

Paolo Carraresi, Claudio Sodini

Publication date: 1986

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(86)90218-3

zbMATH Keywords

threshold algorithmminimum cost bipartite matching problemshortest path sub-problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

A shortest augmenting path algorithm for dense and sparse linear assignment problems

Cites Work

• Unnamed Item
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• Solving the Assignment Problem by Relaxation
• A shortest augmenting path method for solving minimal perfect matching problems
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• The alternating basis algorithm for assignment problems
• A Successive Shortest Path Algorithm for The Assignment Problem

This page was built for publication: An efficient algorithm for the bipartite matching problem