A shortest augmenting path method for solving minimal perfect matching problems
From MaRDI portal
Cites work
Cited in
(17)- A computational study of efficient shortest path algorithms
- Aircrew schedule generation using repeated matching
- Matching problems with generalized upper bound side constraints
- Algorithms for finding k-best perfect matchings
- \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
- Some concepts of stability analysis in combinatorial optimization
- Block designs that provide optimal power in the Cochran-Mantel-Haenszel test
- A repeated matching heuristic for the single-source capacitated facility location problem
- How to find Steiner minimal trees in Euclidean \(d\)-space
- An efficient matching algorithm applied in statistical physics
- Travelling salesman problem tools for microcomputers
- Efficient algorithms for maximum weight matchings in general graphs with small edge weights
- PathLAD+: Towards effective exact methods for subgraph isomorphism problem
- An efficient algorithm for the bipartite matching problem
- An efficient Dijkstra-like labeling method for computing shortest odd/even paths
- Microcomputer-based algorithms for large scale shortest path problems
This page was built for publication: A shortest augmenting path method for solving minimal perfect matching problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3931440)
