Benham's method
Definition of Benham's method:
Do IRV, but before each elimination check if there is an un-eliminated candidate who beats each one of
the other un-eliminated candidates, and elect them if they exist.
X beats Y if more ballots rank X over Y than rank Y over X.
Benham's method is a Smith-efficient Condorcet method. This is because there will always be a point in the count where at least one Smith Set member is uneliminated, and that candidate must beat all other candidates by virtue of being in the Smith Set. Benham's method fails ISDA, however. [1]
A variation of Benham's that addresses the Smith set is "Do IRV, but before each elimination eliminate all candidates outside the (smallest group of candidates such that all candidates in the group pairwise beat all (uneliminated) candidates outside of the group), and repeat until only one candidate remains, who is the winner." This would pass ISDA, since to begin with the voting method eliminates everyone not in the Smith set.
For more information, go to the Woodall's method article.