Solving large-scale matching problems efficiently: A new primal matching approach

DOI10.1002/net.3230160102zbMath0643.90092OpenAlexW1966424895MaRDI QIDQ3786301

Ulrich Derigs

Publication date: 1986

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

weighted matchingtwo-phase approachlarge dense graphsminimum-cost-perfect-matching problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27)

Related Items

An efficient matching algorithm applied in statistical physics, Solving matching problems with linear programming, New primal and dual matching heuristics, Solving (large scale) matching problems combinatorially

Cites Work

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