A skew /spl mu/ lower bound
Rod Holland, Peter Michael Young · 2002
Exploitation of the NP hard, mixed /spl mu/ problem structure provides a polynomial time algorithm that approximates /spl mu/ with usually reasonable answers. When the problem is extended to the skew /spl mu/ problem an extension of the existing method to the skew /spl mu/ formulation is required. The focus of this paper is to extend the /spl mu/ lower bound derivation to the skew /spl mu/ lower bound and show its direct computation by way of a power algorithm.