Given an acyclic digraph , we seek a smallest sized tournament having as a minimum feedback arc set. The reversing number of a digraph is defined to be
We use integer programming methods to obtain new results for the reversing number where is a power of a directed Hamiltonian path. As a result, we establish that known reversing numbers for certain classes of tournaments actually suffice for a larger class of digraphs.
Keywords: Linear ordering, tournament, feedback arc set, di- graph, reversing number