optimization for resolution strategy lowest #717
Description
From #648
A separate issue, but a nice optimisation, would be to have a similar fast-path attempted for the lowest resolution strategy. Namely, if there is only a >= lower bound & resolution strategy is lowest, then:
if the bound itself exists, use that
otherwise resort to the slower checking of all available versions