Pages that link to "Item:Q3931440"
From MaRDI portal
The following pages link to A shortest augmenting path method for solving minimal perfect matching problems (Q3931440):
Displaying 16 items.
- \textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care (Q819093) (← links)
- On the use of optimal fractional matchings for solving the (integer) matching problem (Q1068525) (← links)
- An efficient algorithm for the bipartite matching problem (Q1069866) (← links)
- Microcomputer-based algorithms for large scale shortest path problems (Q1072451) (← links)
- An efficient Dijkstra-like labeling method for computing shortest odd/even paths (Q1072571) (← links)
- Algorithms for finding k-best perfect matchings (Q1090343) (← links)
- A computational study of efficient shortest path algorithms (Q1112733) (← links)
- Travelling salesman problem tools for microcomputers (Q1184464) (← links)
- How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793) (← links)
- Aircrew schedule generation using repeated matching (Q1291572) (← links)
- An efficient matching algorithm applied in statistical physics (Q1331902) (← links)
- A repeated matching heuristic for the single-source capacitated facility location problem (Q1610126) (← links)
- Some concepts of stability analysis in combinatorial optimization (Q1805456) (← links)
- Matching problems with generalized upper bound side constraints (Q3204346) (← links)
- (Q5743485) (← links)
- PathLAD+: Towards effective exact methods for subgraph isomorphism problem (Q6665697) (← links)
