A CUTTING PLANE ALGORITHM FOR A CLUSTERING PROBLEM

被引：200

作者：

GROTSCHEL, M ^{[1
]}

WAKABAYASHI, Y ^{[1
]}

机构：

[1] UNIV SAO PAULO,INST MATH & ESTATIST,BR-01498 SAO PAULO,SP,BRAZIL

来源：

MATHEMATICAL PROGRAMMING | 1989年 / 45卷 / 01期

关键词：

D O I：

10.1007/BF01589097

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：59 / 96

页数：38

共 24 条

[1] AN APPLICATION OF COMBINATORIAL OPTIMIZATION TO STATISTICAL PHYSICS AND CIRCUIT LAYOUT DESIGN [J].

BARAHONA, F ;

GROTSCHEL, M ;

JUNGER, M ;

REINELT, G .

OPERATIONS RESEARCH, 1988, 36 (03) :493-513

[2]

BARTHELEMY JP, 1981, MATH SOC SCI, V1, P235

[3]

BONDY JA, 1976, GRAPH THEORY APPLICA

[4]

CHAH S, 1985, 3 INT S DAT AN BRUSS

[5] SOLVING LARGE-SCALE SYMMETRIC TRAVELING SALESMAN PROBLEMS TO OPTIMALITY [J].

CROWDER, H ;

PADBERG, MW .

MANAGEMENT SCIENCE, 1980, 26 (05) :495-509

[6] SOLVING MATCHING PROBLEMS WITH LINEAR-PROGRAMMING [J].

GROTSCHEL, M ;

HOLLAND, O .

MATHEMATICAL PROGRAMMING, 1985, 33 (03) :243-259

[7] A CUTTING PLANE ALGORITHM FOR THE LINEAR ORDERING PROBLEM [J].

GROTSCHEL, M ;

JUNGER, M ;

REINELT, G .

OPERATIONS RESEARCH, 1984, 32 (06) :1195-1220

[8] THE ELLIPSOID METHOD AND ITS CONSEQUENCES IN COMBINATORIAL OPTIMIZATION [J].

GROTSCHEL, M ;

LOVASZ, L ;

SCHRIJVER, A .

COMBINATORICA, 1981, 1 (02) :169-197

[9]

GROTSCHEL M, 1987, IN PRESS MATH PROGRA

[10]

Hartigan JA., 1975, CLUSTERING ALGORITHM

← 1 2 3 →