PROBLEM REDUCTION METHODS AND A TREE GENERATION ALGORITHM FOR THE STEINER NETWORK PROBLEM

被引：30

作者：

BALAKRISHNAN, A ^{[1
]}

PATEL, NR ^{[1
]}

机构：

[1] INDIAN INST MANAGEMENT,AHMEDABAD 380015,GUJARAT,INDIA

来源：

关键词：

D O I：

10.1002/net.3230170107

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：65 / 85

页数：21

共 20 条

ANEJA, YP .

[2]

BALAKRISHNAN A, 1982, UNPUB FORMULATIONS A

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

BEASLEY, JE .

[4]

BEASLEY JE, 1985, SST BASED ALGORITHM

[5] SOLVING LARGE-SCALE ZERO-ONE LINEAR-PROGRAMMING PROBLEMS [J].

CROWDER, H ;

JOHNSON, EL ;

PADBERG, M .

[6]

Dreyfus SE, 1971, NETWORKS, V1, P195

[7]

ERICKSON RE, 1979, UNPUB MINIMUM CONCAV

[8]

Feldman E., 1966, MANAGE SCI, V12, P670, DOI DOI 10.1287/MNSC.12.9.670

[9]

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

[10]

Garey M. R., 1979, COMPUTERS INTRACTIBI