### Table 1: Results on Combinatorial Problems (STS and Seymour)

"... In PAGE 9: ... On all the CLR instances (Table 3) ITEG nds better solutions than all the algorithms in [14]. Finally, on the other six instances of combinatorial problems ( Table1 ) ITEG nds the best known solution for all but one instance, namely STS.135, where the best known solution is 103, while ITEG can only nd 104.... ..."

### Table 1: Results on Combinatorial Problems (STS and Seymour)

"... In PAGE 9: ... On all the CLR instances (Table 3) ITEG nds better solutions than all the algorithms in [14]. Finally, on the other six instances of combinatorial problems ( Table1 ) ITEG nds the best known solution for all but one instance, namely STS.135, where the best known solution is 103, while ITEG can only nd 104.... ..."

### Table 3: Results on Combinatorial Problems (CYC and CLR)

"... In PAGE 9: ... In 45 cases out of 60 instances it is strictly better. On the CYC instances ( Table3 ) ITEG nds better solutions on 3 out of 6 instances, and equivalent best solutions on other two instances; however, on CYC.9 it does not perform very well if compared with the best result reported in [14].... In PAGE 9: ... This suggests that for the CYC problems the lexicographical order as used in simple Greedy is favourable. On all the CLR instances ( Table3 ) ITEG nds better solutions than all the algorithms in [14]. Finally, on the other six instances of combinatorial problems (Table 1) ITEG nds the best known solution for all but one instance, namely STS.... ..."

### Table 3: Results on Combinatorial Problems (CYC and CLR)

"... In PAGE 9: ... In 45 cases out of 60 instances it is strictly better. On the CYC instances ( Table3 ) ITEG nds better solutions on 3 out of 6 instances, and equivalent best solutions on other two instances; however, on CYC.9 it does not perform very well if compared with the best result reported in [14].... In PAGE 9: ... This suggests that for the CYC problems the lexicographical order as used in simple Greedy is favourable. On all the CLR instances ( Table3 ) ITEG nds better solutions than all the algorithms in [14]. Finally, on the other six instances of combinatorial problems (Table 1) ITEG nds the best known solution for all but one instance, namely STS.... ..."

### Table 2. Results for combinatorial auction problem instances.

2006

"... In PAGE 12: ....n} Table2 shows results for experiments with combinatorial auctions drawn from the regions distribution of the CATS 2.0 test suite [10].... ..."

Cited by 5

### Table 2. Results for combinatorial auction problem instances.

2006

"... In PAGE 12: ....n} Table2 shows results for experiments with combinatorial auctions drawn from the regions distribution of the CATS 2.0 test suite [10].... ..."

Cited by 5

### Table 1 Combinatorial optimization problems and their geometric equivalents

"... In PAGE 10: ... Similarly, if we color the graph with a minimum number of colors, then this is equivalent with dividing the collection of lines into a minimum number of subcollections such that each subcollection contains no parallel pairs of lines. Table1 gives an overview of problems in graph theory and their geometric equivalent. Since in this paper we focus on parallel line grouping, we propose two combi- natorial algorithms that can be used to partition a graph of parallel pairs into subgraphs which are or which resemble cliques.... ..."

### Table 2. Results for combinatorial auction problem instances.

2007

"... In PAGE 10: ... We used the 0/1 ILP formulation described in [6]. Table2 shows the results for experiments with 6 classes of moderate size combi-... ..."

Cited by 1

### Table 1: Combinatorial optimization problems and their autocorrelation functions.

### Table 1. List of applications of ACO algorithms to static combinatorial optimization problems. Classification by application and chronologically ordered.

1999

Cited by 209