### Table 1: Comparison of three heuristics on ten instances.

"... In PAGE 4: ... CPU times were measured with the system function etime. We report in Table1 the results obtained with the three algorithms on four Max-Cut instances. Problem G11, with 800 nodes and 1600 edges, was created by Helmberg and Rendl [7].... ..."

### Table 4: LDS results on the ten instances used in (Applegate amp; Cook, 1991)

"... In PAGE 24: ... On the PJSSP, LDS appeared to work better than DDS. Table4 provides the results obtained by the five LDS variants, LDS-C-E, LDS-R-E, LDS-R-E-JK, LDS-R-B and LDS-R-B-JK, on the ten instances used by Applegate and Cook. Table 5 provides the results for the thirteen instances used by Vaessens, Aarts, and Lenstra.... ..."

### Table 6. Detailed results on the ten instances used in ( Applegate amp; Cook, 1991)

1995

Cited by 55

### Table 2. A Kelb pattern releasing ten instances of task moveForeLeg.

### Table 1 lists the parameters chosen for twosets. For eachset,we generated ten instances.

"... In PAGE 14: ...Table1 : Problem Sets. Set p, m q r S min , S max c min , c max D min , D max d min , d max X max A 3, 3 9 20 100, 200 1, 10 100, 200 0, 40 127 B 3, 3 9 20 100, 200 1, 10 100, 200 -20, 40 127 #0F The change d jk in demand at site j if factor k reaches full strength, for all combinations of j and k.... ..."

### Table 6. Detailed results on the ten instances used in ( Applegate amp; Cook, 1991)

### Table 6. Detailed results on the ten instances used in (Applegate amp; Cook, 1991)

### Table 1: Details for ten instances of twenty jobs Formu- Binary Number of LP Weight- lation variables constraints Relax. ed case

"... In PAGE 4: ... Tighter cuts can be generated sim- ilarly to (20). Table1 presents some improvements given by adding cuts to the POS2 formulation. The lower bound LB2 is given by the dichotomy procedure.... ..."

### Table 1: Results on ten 10x10 instances of the JSSP

1995

"... In PAGE 9: ... It was tested on more than eighty instances. Table1 gives the results obtained on the ten 10x10 JSSP instances used by Applegate amp; Cook in their compu- tational study of the JSSP #5BApplegate amp; Cook, 1991#5D. In Table 1, columns #5CBT quot; and #5CCPU quot; give the total number of backtracks and CPU time needed to #0Cnd an optimal solution and prove its optimality.... In PAGE 9: ... Table 1 gives the results obtained on the ten 10x10 JSSP instances used by Applegate amp; Cook in their compu- tational study of the JSSP #5BApplegate amp; Cook, 1991#5D. In Table1 , columns #5CBT quot; and #5CCPU quot; give the total number of backtracks and CPU time needed to #0Cnd an optimal solution and prove its optimality. Columns #5CBT#28pr#29 quot; and #5CCPU#28pr#29 quot; give the number of backtracks and CPU time needed for the proof of optimality.... ..."

Cited by 2

### Table 5: Results on ten 10x10 instances of the JSSP

1995

Cited by 20