As mentioned earlier, forward auction followed by modified reverse auction can start with arbitrary
initial prices. As a result, one can use -scaling, performing a sequence of auctions with decreasing values
of . Out of several possible variations of the method, the one found most effective in [BCT91] is to use
the modified reverse auction only in the last -scaling phase. In all other -scaling phases, forward auction
is used exclusively. There are also alternative algorithms for the asymmetric assignment problems that
switch between the forward and the reverse methods within each -scaling phase; see [BeC92].