…computationally impractical to find the [pairing] that minimizes cumulative M.
This is essentially a variant on the “traveling salesman” problem, so an optimal or near-optimal solution should be obtainable with readily available computing power for most clinical trials.