### 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 6: Single-commodity Flow Survivable Network Design: Solution Statistics.

2000

"... In PAGE 24: ...0 Barrier and CPLEX 6.0 Simplex) are collected in Table6 . There is no clear winner: the simplex method is best on smaller instances and both IPM codes show a uniform behaviour, less sensitive to the problem size.... ..."

### Table 6: Single-commodity Flow Survivable Network Design: Solution Statistics.

2003

"... In PAGE 24: ... This problem has a less regular structure, with one multicommodity block and many small single-commodity blocks. Network characteristics of the test examples are given in Table 5 and the sizes of the corresponding linear programs are given in Table6 . Since the sizes of these problems vary from small to medium we solved them also with the Cplex default (primal) simplex method.... In PAGE 24: ...implex method. The results for three solvers (our IPM code, Cplex 6.0 Barrier and Cplex 6.0 Simplex) are collected in Table6 . Their analysis indicates that there is no clear winner: the simplex method is best on smaller instances and both IPM codes show a uniform behaviour, less sensitive to the problem size.... ..."

Cited by 18

### 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 I Computational Complexity of Various Problems of Survivable Access Network Design

### TABLE I Computational Complexity of Various Problems of Survivable Access Network Design

### Table 5: Single-commodity Flow Survivable Network Design: Network Statistics.

2003

"... In PAGE 24: ... This problem has a less regular structure, with one multicommodity block and many small single-commodity blocks. Network characteristics of the test examples are given in Table5 and the sizes of the corresponding linear programs are given in Table 6. Since the sizes of these problems vary from small to medium we solved them also with the Cplex default (primal) simplex method.... ..."

Cited by 18

### Table 5: Single-commodity Flow Survivable Network Design: Network Statistics.

2000

"... In PAGE 24: ... This problem has a less regular structure, with one multicommodity block and many small single-commodity blocks. Network characteristics of the test examples are given in Table5 and the sizes of the corresponding linear programs are given in Table 6. Since the sizes of these problems vary from small to medium we solved them also with the CPLEX default (primal) simplex method.... ..."