FORMULATIONS AND ALGORITHMS FOR THE CAPACITATED MINIMAL DIRECTED TREE PROBLEM

被引：107

作者：

GAVISH, B

机构：

来源：

关键词：

D O I：

10.1145/322358.322367

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：118 / 132

页数：15

共 23 条

[1]

BENDERS JF, 1962, NUMER MATH, V4, P238, DOI [10.1007/BF01386316, DOI 10.1007/BF01386316, DOI 10.1007/S10287-004-0020-Y]

[2]

Chandy K.M., 1973, NETWORKS, V3, P173

[3] THE DECOMPOSITION ALGORITHM FOR LINEAR-PROGRAMS [J].

DANTZIG, GB ;

WOLFE, P .

[4]

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

[5] TOPOLOGICAL DESIGN OF MULTIPOINT TELEPROCESSING NETWORKS [J].

ELIAS, D ;

FERGUSON, MJ .

ESAU, LR ;

WILLIAMS, KC .

FISHER, ML .

GABOW, HN .

[9]

GAVISH B, 1982, LAGRANGIAN RELAXATIO

[10]

GAVISH B, UNPUB DISCRETE APPL