REDUCTION TESTS FOR THE STEINER PROBLEM IN GRAPHS

被引：51

作者：

DUIN, CW

VOLGENANT, A

机构：

来源：

NETWORKS | 1989年 / 19卷 / 05期

关键词：

D O I：

10.1002/net.3230190506

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：549 / 567

页数：19

共 16 条

[1] PROBLEM REDUCTION METHODS AND A TREE GENERATION ALGORITHM FOR THE STEINER NETWORK PROBLEM [J].

BALAKRISHNAN, A ;

PATEL, NR .

NETWORKS, 1987, 17 (01) :65-85

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

BEASLEY, JE .

NETWORKS, 1984, 14 (01) :147-159

[3]

BEASLEY JE, 1985, SST BASED ALGORITHM

[4] ON EFFICIENCY OF ALGORITHM FOR STEINER MINIMAL TREES [J].

COCKAYNE, EJ .

SIAM JOURNAL ON APPLIED MATHEMATICS, 1970, 18 (01) :150-&

[5]

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

[6]

Dreyfus SE, 1971, NETWORKS, V1, P195

[7] AN EDGE ELIMINATION TEST FOR THE STEINER PROBLEM IN GRAPHS [J].

DUIN, CW ;

VOLGENANT, A .

OPERATIONS RESEARCH LETTERS, 1989, 8 (02) :79-83

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

DUIN, CW ;

VOLGENANT, A .

NETWORKS, 1987, 17 (03) :353-364

[9]

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

[10] NETWORK DECOMPOSITION FOR THE OPTIMIZATION OF CONNECTION STRUCTURES [J].

IWAINSKY, A ;

CANUTO, E ;

TARASZOW, O ;

VILLA, A .

NETWORKS, 1986, 16 (02) :205-235

← 1 2 →