AUGMENTED LAGRANGEAN BASED ALGORITHMS FOR CENTRALIZED NETWORK DESIGN

被引：84

作者：

GAVISH, B

机构：

来源：

IEEE TRANSACTIONS ON COMMUNICATIONS | 1985年 / 33卷 / 12期

关键词：

D O I：

10.1109/TCOM.1985.1096250

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

引用

页码：1247 / 1257

页数：11

共 30 条

[1]

ALTINKEMER K, UNPUB HEURISTICS CON

[2] A RESTRICTED LAGRANGEAN APPROACH TO THE TRAVELING SALESMAN PROBLEM [J].

BALAS, E ;

CHRISTOFIDES, N .

MATHEMATICAL PROGRAMMING, 1981, 21 (01) :19-46

[3] PATHOLOGY OF TRAVELING-SALESMAN SUBTOUR-ELIMINATION ALGORITHMS [J].

BELLMORE, M ;

MALONE, JC .

OPERATIONS RESEARCH, 1971, 19 (02) :278-&

[4]

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

[5]

DANTZIG GB, 1961, ECONOMETRICA, V29

[6] LOADING PROBLEM [J].

EILON, S ;

CHRISTOF.N .

MANAGEMENT SCIENCE SERIES A-THEORY, 1971, 17 (05) :259-268

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

ELIAS, D ;

FERGUSON, MJ .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1974, CO22 (11) :1753-1762

[8]

ESSAU LR, 1966, IBM SYSTEMS J, V5, P142

[9]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[10] AN ALGORITHM FOR OPTIMAL ROUTE SELECTION IN SNA NETWORKS [J].

GAVISH, B ;

HANTLER, SL .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1983, 31 (10) :1154-1161

← 1 2 3 →