### Table 3: Multicommodity Flow Survivable Network Design: Network Statistics.

2003

"... In PAGE 23: ...ity pattern. Its constraint matrix has dual block-angular structure. Each diagonal block in it is a multicommodity flow problem for some reduced network. We report in Table3 several network characteristics for the test problems: graph sizes and data for original routings (Routes), the number of failures and the number of conditional demands created by them. The latter is a major factor that determines the overall size of the LP formulation (16) of this problem.... ..."

Cited by 18

### Table 3: Multicommodity Flow Survivable Network Design: Network Statistics.

2000

"... In PAGE 23: ...ity pattern. Its constraint matrix has dual block-angular structure. Each diagonal block in it is a multicommodity flow problem for some reduced network. We report in Table3 several network characteristics for the test problems: graph sizes and data for original routings (Routes), the number of failures and the number of conditional demands created by them. The latter is a major factor that determines the overall size of the LP formulation (16) of this problem.... ..."

### Table 1: Lower bounds and computation time with the three Multicommodity Flow instances

"... In PAGE 6: ... cb30 and cb61 are real world instances from compiler design problems, also used in [6, 10], and finally the wcbDC graphs are the cbDC graphs with vertex weights. The problems in Table1 with D4 BP BE and C5 BP CS C6D4 CT corresponds to the classical bisection problem with equally sized partitions. For each of the three Multicommodity Flow instances the lower bound and the com- putation time (format hh:mm:ss) is given.... ..."

### Table 4: Multicommodity Flow Survivable Network Design: Solution Statistics.

2003

"... In PAGE 23: ... The sizes of several test problems and the solution statistics for two solvers, our structure exploiting code and Cplex 6.0 barrier code, are reported in Table4 . To facilitate the comparison we ran both solvers on the same Linux PC with 300 MHz Pentium Pro processor and 384 MB of RAM.... In PAGE 24: ...0 Table 6: Single-commodity Flow Survivable Network Design: Solution Statistics. The analysis of results collected in Table4 reveals that the structure exploiting code is slightly faster than Cplex on these problems. Both codes show slow increase of the number of iterations with the size of the problem.... ..."

Cited by 18

### Table 4: Multicommodity Flow Survivable Network Design: Solution Statistics.

2000

"... In PAGE 23: ... The sizes of several test problems and the solution statistics for two solvers, our structure exploiting code and CPLEX 6.0 barrier code, are reported in Table4 . To facilitate the comparison we ran both solvers on the same Linux PC with 300 MHz Pentium Pro processor and 384 MB of RAM.... In PAGE 24: ...0 Table 6: Single-commodity Flow Survivable Network Design: Solution Statistics. The analysis of results collected in Table4 reveals that the structure exploiting code is slightly faster than CPLEX on these problems. Both codes show slow increase of the number of iterations with the size of the problem.... ..."

### TABLE 8.2.1. Multi-commodity network flow test problems statistics

1989

Cited by 50

### Table 2 shows the results of the multicommodity flow algorithm (with pin assignment) when run with BW BP BD, i.e., when the objective is to minimize the wire and buffer congestion only. The table shows that progressively better fractional solutions are obtained by the approximation algo- rithm. The results also show the tradeoff between conges- tion on one hand and wiring resources (number of buffers and wirelength) on the other hand.

2002

"... In PAGE 7: ... We note that routing and pin assignment is per- formed by our algorithm in virtually the same time as rout- ing alone. Table2 . Congestion minimization results (BW BP BD).... ..."

Cited by 3

### Table 2. Congestion minimization results (BW BP BD).

2002

"... In PAGE 7: ... The circuit parameters are summarized in Table 1. Table2 shows the results of the multicommodity flow algorithm (with pin assignment) when run with BW BP BD, i.e.... ..."

Cited by 3

### Table 1: Minimum Cost Network Flow Problems: Network Statistics.

2003

"... In PAGE 23: ...uns. The efficiency of the parallel code is discussed in the following section. We start with the presentation of numerical results obtained for the multicommodity network flow problems (15). In Table1 we report the characteristics of the networks: the numbers of nodes |V|, arcs |E| and demands |D|, respectively. In Table 2 we report the sizes of the resulting linear programs and the solution statistics: the numbers of iterations and the CPU time in seconds on SUN HPC.... ..."

Cited by 18

### Table 1: Minimum Cost Network Flow Problems: Network Statistics.

2000

"... In PAGE 23: ...uns. The e ciency of the parallel code is discussed in the following section. We start with the presentation of numerical results obtained for the multicommodity network flow problems (15). In Table1 we report the characteristics of the networks: the numbers of nodes jVj,arcsjEj and demands jDj, respectively. In Table 2 we report the sizes of the resulting linear programs and the solution statistics: the numbers of iterations and the CPU time in seconds on the Sun HPC.... ..."