APA (7th ed.) Citation

BORGWARDT, K. H., & HUHN, P. (1999). A lower bound on the average number of pivot-steps for solving linear programs valid for all variants of the simplex-algorithm. Mathematical methods of operations research (Heidelberg, Germany), 49(2), 175-210. https://doi.org/10.1007/s186-1999-8373-5

Chicago Style (17th ed.) Citation

BORGWARDT, K. H., and P. HUHN. "A Lower Bound on the Average Number of Pivot-steps for Solving Linear Programs Valid for All Variants of the Simplex-algorithm." Mathematical Methods of Operations Research (Heidelberg, Germany) 49, no. 2 (1999): 175-210. https://doi.org/10.1007/s186-1999-8373-5.

MLA (9th ed.) Citation

BORGWARDT, K. H., and P. HUHN. "A Lower Bound on the Average Number of Pivot-steps for Solving Linear Programs Valid for All Variants of the Simplex-algorithm." Mathematical Methods of Operations Research (Heidelberg, Germany), vol. 49, no. 2, 1999, pp. 175-210, https://doi.org/10.1007/s186-1999-8373-5.