@Article{JCM-28-837,
author = {},
title = {A Fast Simplex Algorithm for Linear Programming},
journal = {Journal of Computational Mathematics},
year = {2010},
volume = {28},
number = {6},
pages = {837--847},
abstract = {<p style="text-align: justify;">Recently, computational results demonstrated remarkable superiority of a so-called &quot;largest-distance&quot; rule and &quot;nested pricing&quot; rule to other major rules commonly used in practice, such as Dantzig&#39;s original rule, the steepest-edge rule and Devex rule. Our computational experiments show that the simplex algorithm using a combination of these rules turned out to be even more efficient.</p>},
issn = {1991-7139},
doi = {https://doi.org/10.4208/jcm.3105-m2897},
url = {http://global-sci.org/intro/article_detail/jcm/8553.html}
}