<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>03869058</id>
  <dt>j</dt>
  <an>03869058</an>
  <augroup>
    <au>Adler, Ilan</au>
    <au>Megiddo, Nimrod</au>
    <au>Todd, Michael J.</au>
  </augroup>
  <ti>New results on the average behavior of simplex algorithms.</ti>
  <so>Bull. Am. Math. Soc., New Ser. 11, 378-382 (1984).</so>
  <py>1984</py>
  <pu>American Mathematical Society, Providence, RI</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>average behavior</ut>
    <ut>performance of simplex algorithms</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1090/S0273-0979-1984-15317-5</li>
  </ligroup>
  <abgroup>
    <ab>Summary: It has been a challenge for mathematicians to theoretically confirm the extremely good performance of simplex algorithms for linear programming. We have confirmed that a certain variant of the simplex method solves problems of order $m\times n$ in an expected number of steps which is bounded between two quadratic functions of the smaller dimension of the problem. Our probabilistic assumptions are rather weak.</ab>
    <rv></rv>
  </abgroup>
</item>