### Table 2: Neo-informal scenarios

### TABLE I COMPARISON OF NEO, Astir AND Astute

### Table 1: The number of submissions through each interface to NEOS since the August, 2005, release of NEOS version 5.

2007

"... In PAGE 14: ...retrieving results, and setting up new solvers to run on NEOS. This API is new to NEOS, but as can be seen in Table1 , it already comprises almost one- sixth of all new NEOS job submissions. This number does not mean that one-sixth of all users are using this interface, however, because the ability to auto- mate submissions allows a minority of NEOS users to skew the statistics by easily submitting hundreds or in some cases even thousands of jobs to the NEOS server.... ..."

### Table 3. (Continued)

"... In PAGE 14: .... FEISEL, J. VON ZUR GATHEN, AND M. A. SHOKROLLAHI Table3 . Improvements for q =3and2 n 400 n p(3;n) g(3;n)ratio r K 2 212.... In PAGE 16: .... FEISEL, J. VON ZUR GATHEN, AND M. A. SHOKROLLAHI Table3 . (Continued) n p(3;n) g(3;n)ratio r K 332 824.... ..."

### Table 1: The von Neumann-Halperin Algorithm

2006

Cited by 2

### Table 1: Beobachtete Typen von Aussprachevarianten

### Table III. Computation times in seconds and number of iterations for minimum cost and minimum makespan problems, using the Ben- ders method. Each figure represents the aver- age of 5 instances.

2004

Cited by 15

### Table IV. Computation times in seconds and number of iterations for minimum cost and minimum makespan problems, using the Ben- ders method. Each figure represents the aver- age of 5 instances.

2004

Cited by 15

### Table 5.8: Results comparing LANCELOT, CSAAT ID and CSAGAAT ID in solving discrete constrained NLPs derived from selected continuous problems in CUTE, using the starting point speci ed in each problem. All times are in seconds on a Pentium-III 600-MHz computer running Solaris 7. 0 0 means that no feasible solution can be found by both the public version (01/05/2000) and the commercial version of LANCELOT (by submitting problems through the Internet, http://www-neos.mcs.anl.gov/neos/solvers/NCO:LANCELOT/). Boxed num- bers represent the best solutions among the three methods if they have di erent solutions.

2001

Cited by 6