On the Worst Case Complexity of Potential Reduction Algorithms for Linear Programming
Mathematical Programming, Series B - Germany
doi 10.1007/bf02614620
Full Text
Open PDFAbstract
Available in full text
Date
May 1, 1997
Authors
Publisher
Springer Science and Business Media LLC