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 条

[11]

GROVER WD, 1999, TELECOMMUNICATIONS P

[12]

Held M., 1974, Mathematical Programming, V6, P62, DOI 10.1007/BF01580223

[13] Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks [J].

Iraschko, RR ;

MacGregor, MH ;

Grover, WD .

IEEE-ACM TRANSACTIONS ON NETWORKING, 1998, 6 (03) :325-336

[14]

IRI M, 1971, J OPER RES SOC JPN, V13, P129

[15] SURVEY OF LINEAR COST MULTICOMMODITY NETWORK FLOWS [J].

KENNINGTON, JL .

OPERATIONS RESEARCH, 1978, 26 (02) :209-236

[16]

MINOUX M, 1981, RAIRO-RECH OPER, V15, P185

[17]

MINOUX M, 1981, STUDIES GRAPHS DISCR

[18]

MINOUX M, 1987, ANN DISCRETE MATH, V31, P283

[19]

MINOUX M, 1986, MATH PROGRAMMING THE

[20]

MURTY KG, 1976, LINEAR COMBINATORIAL

← 1 2 3 →