### Table 2: Branch-and-cut-and-price results.

2003

"... In PAGE 8: ... We remark that the exact separation of capacity constraints by solving MIPs responds for more than 70% of the L3 Time on average. Table2 presents results of our complete branch-and-cut-and-price algorithm. Columns L3 and Root Time repeat information already given in the previous table.... ..."

Cited by 18

### Table 6: Branch-and-cut-and-price results on the second data set (instances proposed by Li and Lim (2001)). 100 requests.

2007

"... In PAGE 31: ...he instances more difficult to solve. The branch-and-cut code from Ropke et al. (2007) is clearly outperformed as it only manages to solve 12 instances within the time limit. Table6 shows results for Li and Lim (2001) instances in the first series and with ap- proximately 100 requests. Li and Lim (2001) also proposed instances with 50 requests, but the first series of these instances do not pose any difficulty for the branch-and-cut-and-price algorithm as all instances can be solved in less than 10 minutes (see Ropke (2005)).... ..."

Cited by 2

### Table 1: Experimental results

2003

"... In PAGE 6: ...1 as LP solver. Table1 presents results of our complete branch-and-cut-and-price algorithm. The rst column con- tains the instance name, made up by its series, the number of vertices, and the value of K.... ..."

Cited by 18

### Table 5: Branch-and-cut-and-price results on the first data set.

2007

"... In PAGE 30: ... All valid inequalities presented in Section 4 and which are not implied by the relaxations are added dynamically to the model. The results for the first data set are shown in Table5 . The first two columns show the instance name and the best known upper bound (the optimal solution value in the case of instances solved to optimality and the heuristic value from Table 2 otherwise).... ..."

Cited by 2

### Table 7: Branch-and-cut-and-price results on the second data set (instances proposed by Li and Lim (2001)). Instances with 500 requests and tight time windows.

2007

"... In PAGE 31: ... We chose the six instances that have the tightest time windows. The results of this experiment are shown in Table7 . Both relaxations are able to solve three instances with 500 requests.... ..."

Cited by 2

### Table 8 2D-2CP: medium+large instances, pure approaches: pure branching (BP), pure cuts (CPA), pure branch-and-cut-and-price (no rounding, BCP)

### Table 5 Branch-and-Price Results on k-way Equipartition for Microaggregation Prob- lems for S = 4

"... In PAGE 16: ... An example of the solution on this kind of data is shown in Figure 2. Table5 shows the results for graphs with S = 4, graph size n ranging from 40 to 100. The table is divided into three parts to represent the performance of the heuristic algorithm, the root node of the branch-and-price-and-cut algorithm, and the branch-and-price tree.... ..."

### Table 1 Notations for test results

"... In PAGE 21: ... One property of these instances is that the LP relaxation value is integer or slightly less which makes it difficult to find an optimum for the 23 IRUP instances among them. Table 3 contains some problem data (see Table1 for notations), then algo- rithmic results in two sections: pure branch-and-price (BP) and branch-and- cut-and-price (BCP) with at most two cuts in the LP formulation and new local cuts generated in every node. The CPLEX mixed-integer solver was not used because it takes very long time on these instances.... ..."

### Table 3 The hard28 set of the bin-packing problem

"... In PAGE 21: ... One property of these instances is that the LP relaxation value is integer or slightly less which makes it difficult to find an optimum for the 23 IRUP instances among them. Table3 contains some problem data (see Table 1 for notations), then algo- rithmic results in two sections: pure branch-and-price (BP) and branch-and- cut-and-price (BCP) with at most two cuts in the LP formulation and new local cuts generated in every node. The CPLEX mixed-integer solver was not used because it takes very long time on these instances.... ..."

### Table 1. Comparison of results between grids with and without diagonals. New results

1994

"... In PAGE 2: ... For two-dimensional n n meshes without diagonals 1-1 problems have been studied for more than twenty years. The so far fastest solutions for 1-1 problems and for h-h problems with small h 9 are summarized in Table1 . In that table we also present our new results on grids with diagonals and compare them with those for grids without diagonals.... ..."

Cited by 11