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

DOI10.1002/NET.3230160102MaRDI QIDQ3786301zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Solving (large scale) matching problems combinatorially
• scientific article; zbMATH DE number 515943
• New primal and dual matching heuristics
• A New Approach to Stable Matching Problems
• Approximating multistage matching problems
• Approximating multistage matching problems
• Finding large stable matchings
• Computing large matchings fast
• Improving solution times for stable matching problems through preprocessing
• Faster and simpler approximation of stable matchings

Cites work

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

Cited in

(6)

• Solving (large scale) matching problems combinatorially
• scientific article; zbMATH DE number 515943 (Why is no real title available?)
• An efficient matching algorithm applied in statistical physics
• Solving matching problems with linear programming
• New primal and dual matching heuristics
• Solving maximum weighted matching on large graphs with deep reinforcement learning

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3786301)