On the use of optimal fractional matchings for solving the (integer) matching problem

DOI10.1007/BF02240072zbMath0582.65051OpenAlexW1505177662MaRDI QIDQ1068525

Ulrich Derigs, A. Metz

Publication date: 1986

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02240072

zbMATH Keywords

numerical examplesmatching problemassignment problemaugmenting path methodoptimal fractional matchings

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items

\textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care, An efficient matching algorithm applied in statistical physics, Solving combinatorial optimization problems using Karmarkar's algorithm, Blossom V: A new implementation of a minimum cost perfect matching algorithm, Testing the necklace condition for shortest tours and optimal factors in the plane, Solving (large scale) matching problems combinatorially, Approximation algorithms in combinatorial scientific computing, Efficient Approximation Algorithms for Weighted $b$-Matching, Aircrew schedule generation using repeated matching, A repeated matching heuristic for the single-source capacitated facility location problem

Cites Work

• Unnamed Item
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• A shortest augmenting path method for solving minimal perfect matching problems
• Maximum matching and a polyhedron with 0,1-vertices