THE NODE-WEIGHTED STEINER TREE PROBLEM

被引:72
作者
SEGEV, A
机构
关键词
D O I
10.1002/net.3230170102
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:1 / 17
页数:17
相关论文
共 23 条
[1]   AN INTEGER LINEAR-PROGRAMMING APPROACH TO THE STEINER PROBLEM IN GRAPHS [J].
ANEJA, YP .
NETWORKS, 1980, 10 (02) :167-178
[2]   AN ALGORITHM FOR THE STEINER PROBLEM IN GRAPHS [J].
BEASLEY, JE .
NETWORKS, 1984, 14 (01) :147-159
[3]   LOCATION OF BANK ACCOUNTS TO OPTIMIZE FLOAT - ANALYTIC STUDY OF EXACT AND APPROXIMATE ALGORITHMS [J].
CORNUEJOLS, G ;
FISHER, ML ;
NEMHAUSER, GL .
MANAGEMENT SCIENCE, 1977, 23 (08) :789-810
[4]  
Dreyfus SE, 1971, NETWORKS, V1, P195
[5]   DUAL-BASED PROCEDURE FOR UNCAPACITATED FACILITY LOCATION [J].
ERLENKOTTER, D .
OPERATIONS RESEARCH, 1978, 26 (06) :992-1009
[6]   THE LAGRANGIAN-RELAXATION METHOD FOR SOLVING INTEGER PROGRAMMING-PROBLEMS [J].
FISHER, ML .
MANAGEMENT SCIENCE, 1981, 27 (01) :1-18
[7]  
Garey R., 1979, COMPUTERS INTRACTABI
[8]   TOPOLOGICAL DESIGN OF CENTRALIZED COMPUTER-NETWORKS - FORMULATIONS AND ALGORITHMS [J].
GAVISH, B .
NETWORKS, 1982, 12 (04) :355-377
[9]  
GAVISH B, 1980, OPTIMAL SOLUTION MET
[10]   LAGRANGEAN RELAXATION APPLIED TO CAPACITATED FACILITY LOCATION PROBLEMS [J].
GEOFFRION, A ;
MCBRIDE, R .
AIIE TRANSACTIONS, 1978, 10 (01) :40-47