### Table 6 for the bin packing problems (up to size 4000).

2003

"... In PAGE 14: ...Table 5: Memoryless Results for Cutting Stock Problems Prob HACO No memory bins time bins time u120 0 1 0 1 u250 +2 52 +6 166 u500 0 50 +5 432 u1000 0 147 +10 1850 u2000 0 531 +43 19286 u4000 0 7190 +118 131137 Table6 : Memoryless Results for Uniform Bin Packing Problems It is clear from these results that the local search procedure can solve small problems but needs the ACO procedure when larger problems are encountered. The memoryless procedure fails to find the optimum for the three largest cutting stock problems and for many of the larger bin packing problems (including all of the u2000 and u4000 instances).... ..."

Cited by 3

### Table 6 Memoryless results for uniform bin packing problems

"... In PAGE 10: ... This meant that the initial matrix entries were left undisturbed throughout the run. The results of these runs are shown in Table 5 for the cutting stock problems and Table6 for the bin packing problems (up to size 4000). It is clear from these results that the local search procedure can solve small problems but needs the ACO procedure when larger problems are encountered.... ..."

### Table 7. 2-D bin packing problem.

### Table 8. 3-D bin packing problem.

### Table #-1. A bin-packing problem

### Table 1: Thresholds and free variables for recognition. result bin size

1998

"... In PAGE 26: ... In order to accurately convey the dependence of our algorithm on thresholds and free variables, we have provided a table of values for each of the results shown. In Table1 , the first free variable, bin size, is the size of the bins used to create spin images for the model (Section 2.1) expressed in units of model resolution.... ..."

Cited by 35

### Table 1: Thresholds and free variables for recognition. result bin size

"... In PAGE 26: ... In order to accurately convey the dependence of our algorithm on thresholds and free variables, we have provided a table of values for each of the results shown. In Table1 , the first free variable, bin size, is the size of the bins used to create spin images for the model (Section 2.1) expressed in units of model resolution.... ..."

### Table 5: Comparison of various neighbourhood structures

"... In PAGE 17: ...or the same problems as in Section 4.1.3 for GA. We tried out the constant neighbour =1andneighbour = 3 and the variable structure with setting maxneigh =7andminneigh = 3 in (7). Table5 shows the the average relative deviation from the Branch and Bound solutions for the ISDN test suite. On av- erage, our adaptive neighbourhood structure outperformed the xed structures, but in some cases (especially for unit input vectors) we got better solutions... ..."