OPTIMAL PARTITIONING OF GRAPHS

被引:16
作者
CHRISTOFIDES, N [1 ]
BROOKER, P [1 ]
机构
[1] IMPERIAL COLL SCI & TECHNOL,DEPT MANAGEMENT SCI,LONDON SW7 2BX,ENGLAND
关键词
D O I
10.1137/0130006
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:55 / 69
页数:15
相关论文
共 18 条
[1]  
Berge C., 1965, PROGRAMMING GAMES TR
[2]   RECENT DEVELOPMENTS IN AUTOMATED DESIGN AND ANALYSIS OF DIGITAL SYSTEMS [J].
BREUER, MA .
PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1972, 60 (01) :12-+
[3]  
CHRISTOFIDES N, 1971, INT J PHYS DIST, P87
[4]  
Ford Lester R., 1962, FLOWS NETWORKS
[5]  
GARFINKEL RS, 1970, MANAGE SCI B-APPL, V16, pB495
[6]   INTEGER PROGRAMMING BY IMPLICIT ENUMERATION AND BALAS METHOD [J].
GEOFFRION, AM .
SIAM REVIEW, 1967, 9 (02) :178-+
[7]   THEORY AND COMPUTATION OF KNAPSACK FUNCTIONS [J].
GILMORE, PC ;
GOMORY, RE .
OPERATIONS RESEARCH, 1966, 14 (06) :1045-&
[8]   MULTISTAGE CUTTING STOCK PROBLEMS OF 2 AND MORE DIMENSIONS [J].
GILMORE, PC ;
GOMORY, RE .
OPERATIONS RESEARCH, 1965, 13 (01) :94-&
[9]   MULTI-TERMINAL NETWORK FLOWS [J].
GOMORY, RE ;
HU, TC .
JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1961, 9 (04) :551-570
[10]  
GORINSHTEYN LL, 1969, PARTITIONING GRAPHS, P76