AN SST-BASED ALGORITHM FOR THE STEINER PROBLEM IN GRAPHS

被引：87

作者：

BEASLEY, JE

机构：

来源：

NETWORKS | 1989年 / 19卷 / 01期

关键词：

D O I：

10.1002/net.3230190102

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：1 / 16

页数：16

共 23 条

[1] AN INTEGER LINEAR-PROGRAMMING APPROACH TO THE STEINER PROBLEM IN GRAPHS [J].

ANEJA, YP .

NETWORKS, 1980, 10 (02) :167-178

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

BALAKRISHNAN, A ;

PATEL, NR .

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

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

BEASLEY, JE .

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

[4]

DUIN CW, 1986, GENERALIZATIONS STEI

[5] THE LAGRANGIAN-RELAXATION METHOD FOR SOLVING INTEGER PROGRAMMING-PROBLEMS [J].

FISHER, ML .

MANAGEMENT SCIENCE, 1981, 27 (01) :1-18

[6] AN APPLICATIONS ORIENTED GUIDE TO LAGRANGIAN-RELAXATION [J].

FISHER, ML .

INTERFACES, 1985, 15 (02) :10-21

[7] ALGORITHM-97 - SHORTEST PATH [J].

FLOYD, RW .

COMMUNICATIONS OF THE ACM, 1962, 5 (06) :345-345

[8]

Gabow H. N., 1977, SIAM Journal on Computing, V6, P139, DOI 10.1137/0206011

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

IWAINSKY, A ;

CANUTO, E ;

TARASZOW, O ;

VILLA, A .

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

[10]

Kruskal J. B., 1956, P AM MATH SOC, V7, P48, DOI [10.2307/2033241, DOI 10.1090/S0002-9939-1956-0078686-7]

← 1 2 3 →