AN EDGE ELIMINATION TEST FOR THE STEINER PROBLEM IN GRAPHS

被引：11

作者：

DUIN, CW

VOLGENANT, A

机构：

来源：

关键词：

D O I：

10.1016/0167-6377(89)90005-9

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：79 / 83

页数：5

共 10 条

BALAKRISHNAN, A ;

PATEL, NR .

[2] AN ALGORITHM FOR THE STEINER PROBLEM IN GRAPHS [J].

BEASLEY, JE .

[3]

BEASLEY JE, 1985, SST BASED ALGORITHM

[4]

Dijkstra E. W., 1959, NUMER MATH, V1, P269, DOI DOI 10.1007/BF01386390

[5] REDUCING THE HIERARCHICAL NETWORK DESIGN PROBLEM [J].

DUIN, C ;

VOLGENANT, A .

[6] SOME GENERALIZATIONS OF THE STEINER PROBLEM IN GRAPHS [J].

DUIN, CW ;

VOLGENANT, A .

[7]

DUIN CW, 1986, IN PRESS NETWORKS

[8]

Hakimi S. L., 1971, Networks, V1, P113, DOI 10.1002/net.3230010203

[9]

Maculan N., 1987, N HOLLAND MATH STUDI, V31, P185

[10] STEINER PROBLEM IN NETWORKS - A SURVEY [J].

WINTER, P .