NETWORK DECOMPOSITION FOR THE OPTIMIZATION OF CONNECTION STRUCTURES

被引：13

作者：

IWAINSKY, A ^{[1
]}

CANUTO, E ^{[1
]}

TARASZOW, O ^{[1
]}

VILLA, A ^{[1
]}

机构：

[1] POLITECN TORINO, DIPARTIMENTO AUTOMAT & INFORMAT, I-10128 TURIN, ITALY

来源：

关键词：

D O I：

10.1002/net.3230160209

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：205 / 235

页数：31

共 24 条

[1]

Bellman R., 1958, Q APPL MATH, V16, P87

[2]

CARRE BA, 1971, J I MATH APPL, V7, P653

[3]

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

[4]

DORING S, 1985, OPTIMIZATION CONNECT, P177

[5]

DORING S, 1984, FEB BIL M GDR IT ADV, P145

[6] ALGORITHM-97 - SHORTEST PATH [J].

FLOYD, RW .

[7] SPARSE-MATRIX TECHNIQUES FOR SHORTEST PATH PROBLEM [J].

GOTO, S ;

OHTSUKI, T ;

YOSHIMURA, T .

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1976, 23 (12) :752-758

[8]

GOTO S, 1979 P ISCAS

[9] A DECOMPOSITION ALGORITHM FOR SHORTEST PATHS IN A NETWORK [J].

HU, TC .

[10]

IWAINSKY A, UNPUB SOME VARIANTS