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

From MaRDI portal

Revision as of 13:30, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3786301

Jump to:navigation, search

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 matching two-phase approach large dense graphs minimum-cost-perfect-matching problem

Mathematics Subject Classification ID

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

Related Items (4)

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

This page was built for publication: Solving large-scale matching problems efficiently: A new primal matching approach

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3786301&oldid=17346054"