A DUAL ASCENT APPROACH FOR STEINER TREE PROBLEMS ON A DIRECTED GRAPH

被引：215

作者：

WONG, RT

机构：

来源：

关键词：

D O I：

10.1007/BF02612335

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：271 / 287

页数：17

共 22 条

ANEJA, YP .

[2]

Bilde O., 1977, ANN DISCRETE MATH, V1, P79

[3]

CHU YJ, 1965, SCI SINICA, V14, P1396

CORNUEJOLS, G ;

FISHER, ML ;

NEMHAUSER, GL .

[5]

Dreyfus SE, 1971, NETWORKS, V1, P195

[6] OPTIMUM BRANCHINGS [J].

EDMONDS, J .

JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1967, B 71 (04) :233-+

[7]

ERICKSON RE, 1981, UNPUB MINIMUM CONCAV

[8] DUAL-BASED PROCEDURE FOR UNCAPACITATED FACILITY LOCATION [J].

ERLENKOTTER, D .

[9] DATABASE LOCATION IN COMPUTER-NETWORKS [J].

FISHER, ML ;

HOCHBAUM, DS .

[10]

FISHER ML, 1980, MAY ORSA TIMS M WASH