Constraint generation for network reliability problems

被引：3

作者：

Shaio, J ^{[1
]}

机构：

[1] Vivace Networks Inc, San Jose, CA 95134 USA

来源：

ANNALS OF OPERATIONS RESEARCH | 2001年 / 106卷 / 1-4期

关键词：

network reliability; networks/graphs; multicommodity flows; mathematical programming;

D O I：

10.1023/A:1014561725448

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper presents a constraint generation approach to the network reliability problem of adding spare capacity at minimum cost that allows the traffic on a failed link to be rerouted to its destination. Any number of non-sitnultaneous link failures can be part of the requirements on the spare capacity. The key result is a necessary and sufficient condition for a multicommodity flow to exist, which is derived in the appendix. Computational results on large numbers of random networks are presented.

引用

页码：155 / 180

页数：26

共 22 条

[1]

[Anonymous], 1999, 2792 IETF RFC

[2]

[Anonymous], 3031 RFC INT ENG TAS

[3] MULTICOMMODITY NETWORK FLOWS - SURVEY [J].