Small minimum-cost pairing
Find a minimum-cost one-to-one pairing from a declared cost matrix.
Your entries stay in this page’s memory and are not submitted to us. Downloads are generated locally. Reloading or leaving the page clears your entries. Do not enter patient information.
Follow the labeled row format. Use synthetic values only. All calculations stay in your browser; no uploads. Finite magnitudes up to 1e9 and at least 1e-12, or zero.
The starting values are hypothetical. Results update as you edit. Use aggregate or synthetic inputs only.
Calculation results
- Column for each row (one-based)
- 2, 1, 3
- Minimum total cost
- 9
- Assignments examined
- 6
How to interpret the output
Enumerates every assignment for a small square nonnegative cost matrix. Each row and column is used exactly once; minimizes summed cost. Exact ties select the first lexicographic mapping. Does not support forbidden edges, rectangular matrices or extra constraints. Source checked 16 November 2026.
Method reference