### Table 1 Main results for IMFP, IMCP and their subproblems IMFP IMCP UnSplitFlow CapPath EdgeDisjPath Multiterminal

2001

"... In PAGE 13: ....-C. Costa et al. / European Journal tiflow problems, and of their subproblems, is often in planar graphs, the multiterminal cut and inte- gral flow problems in acyclic graphs and the multicut and integral flow problems in directed trees. Finally, we would like to point out that there are still some interesting opened questions: what is the complexity of the two flow problem in directed bipartite graphs? Is it possible to approximate within a constant ratio the minimum multicut problem in unrestricted graphs? To conclude this survey, we give Table1 which summarizes the most significant results. References [1] R.... ..."

### Table 1: Time with and without cuts SETS CONS VARS NO CUTS CUTS NO CUTS CUTS

2000

"... In PAGE 8: ...Table1 has for each problem size the average CPU time in seconds with and without cut generation to obtain a proven optimal solution and the rst feasible solution. Table 2 has for each problem size the average number of nodes processed with and without cut generation, as well as the number of cuts generated, to obtain a proven optimal solution and the rst solution.... ..."

Cited by 6

### Table 2: Semantic neighbours of the verbs cut, cut out, and cut off .

2003

"... In PAGE 5: ... We used these models to compare different words, and to find their neighbours. For example, the neigh- bours of the simplex verb cut and the verb-particles cut out and cut off (from the BNC model) are shown in Table2 . As can be seen, several of the neighbours of cut out are from similar semantic areas as those... ..."

Cited by 27

### Table 2: Semantic neighbours of the verbs cut, cut out, and cut off .

2003

"... In PAGE 5: ... We used these models to compare different words, and to find their neighbours. For example, the neigh- bours of the simplex verb cut and the verb-particles cut out and cut off (from the BNC model) are shown in Table2 . As can be seen, several of the neighbours of cut out are from similar semantic areas as those... ..."

Cited by 27

### Table 3: Comparison of Time spent in Di#0Berent Filters

1999

"... In PAGE 5: ... Table3 presents detailed results for verifying c432 against its heavily optimized version. The results show... ..."

Cited by 6

### Table 2. Comparison with GMI cuts and MIR cuts

2006

"... In PAGE 11: ... In Tables 2 and 3 we report comparisons with classical families of cutting planes that are valid for the Gomory mixed integer closure: Gomory Mixed In- teger cuts from the optimal tableau of the LP relaxation, MIR cuts (Marchand and Wolsey [22]) and lift-and-project cuts [3]. Specifically, the columns GMI and MIR in Table2 refer to one round of Gomory Mixed Integer cuts, and of Mixed Integer Rounding cuts respectively, as implemented in the COIN-OR cut generator [10]. The column L amp;P in Table 3 refers to the gap closed by the lift- and-project closure plus a strengthening step, as implemented by Bonami and Minoux [6].... ..."

Cited by 2

### TABLES [fb] Basic Cuts in (4) Cuts in (6) Cuts in (8)

### TABLES [fb] Basic Cuts in (4) Cuts in (6) Cuts in (8)

### Table 1: CUT Types

1996

"... In PAGE 2: ... 1: Basic Data-Flow Block Diagram of Test Chip 2.2 CUTs Table1 lists the five types of CUTs that were designed, including two multipliers and three control blocks. The sizes of the CUTs are given in terms of LSI gate equivalents.... ..."

Cited by 7