Enumerate all minimum feedback arc sets

Question

I am looking for (practically) efficient algorithms to enumerate all minimum feedback arc sets of a directed graph. What algorithms should I look at, with practical implementations in mind?

Currently I am using this algorithm to find all minimal solutions, then pick out the smallest ones:

• B Schwikowski & E Speckenmeyer, On enumerating all minimal solutions of feedback problems