A shortest augmenting path method for solving minimal perfect matching problems
From MaRDI portal
Publication:3931440
DOI10.1002/net.3230110407zbMath0475.05069MaRDI QIDQ3931440
Publication date: 1981
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230110407
68R10: Graph theory (including graph drawing) in computer science
90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
\textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care, On the use of optimal fractional matchings for solving the (integer) matching problem, An efficient algorithm for the bipartite matching problem, Microcomputer-based algorithms for large scale shortest path problems, An efficient Dijkstra-like labeling method for computing shortest odd/even paths, Algorithms for finding k-best perfect matchings, A computational study of efficient shortest path algorithms, Travelling salesman problem tools for microcomputers, How to find Steiner minimal trees in Euclidean \(d\)-space, Aircrew schedule generation using repeated matching, An efficient matching algorithm applied in statistical physics, A repeated matching heuristic for the single-source capacitated facility location problem, Some concepts of stability analysis in combinatorial optimization, Matching problems with generalized upper bound side constraints
Cites Work
