### Table 2. Heuristic performance for large problems

"... In PAGE 6: ... But at the same time the probabilistic methods re- quire much more computation time. Table2 reports the results of the problems... ..."

### TABLE 2. Pairwise comparisons on very large problems

2000

Cited by 48

### Table 12: GENCAN with very large problems.

2001

"... In PAGE 29: ... Both methods found a global solution in all the cases. In Table12 we also report the number of free variables at the solution so far found by GENCAN. GENCAN Problem(n) using Fortran subroutines using SIF LANCELOT IT FE GE CG Time IT FE GE CG Time IT FE GE CG Time 1(400) 2 3 3 2 0.... ..."

### Table 12: GENCAN with very large problems.

2001

"... In PAGE 29: ... Both methods found a global solution in all the cases. In Table12 we also report the number of free variables at the solution so far found by GENCAN. GENCAN Problem(n) using Fortran subroutines using SIF LANCELOT IT FE GE CG Time IT FE GE CG Time IT FE GE CG Time 1(400) 2 3 3 2 0.... ..."

### Table 5.4: Results for Large Problems

in A Set Covering Approach To Infeasibility Analysis Of Linear Programming Problems And Related Issues

1995

Cited by 8

### Table 7: RQP: Large problems m = 15

### Table 8: LANC: Large problems m = 15.

### Table 9: PLA: Large problems m = 15.

### Table 1. Comparison of FDA and BKDA on large problems.

2005