STABULUS - A TECHNIQUE FOR FINDING STABLE SETS IN LARGE GRAPHS WITH TABU SEARCH

被引：61

作者：

FRIDEN, C

HERTZ, A

DEWERRA, D

机构：

来源：

COMPUTING | 1989年 / 42卷 / 01期

关键词：

D O I：

10.1007/BF02243141

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：35 / 44

页数：10

共 11 条

[1] FINDING A MAXIMUM CLIQUE IN AN ARBITRARY GRAPH [J].

BALAS, E ;

YU, CS .

SIAM JOURNAL ON COMPUTING, 1986, 15 (04) :1054-1068

[2]

Berge C., 1983, GRAPHES

[3]

Bollobas B., 1985, ANN DISCRETE MATH, V28, P47

[4] SOME EXPERIMENTS WITH SIMULATED ANNEALING FOR COLORING GRAPHS [J].

CHAMS, M ;

HERTZ, A ;

DEWERRA, D .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1987, 32 (02) :260-266

[5] FUTURE PATHS FOR INTEGER PROGRAMMING AND LINKS TO ARTIFICIAL-INTELLIGENCE [J].

GLOVER, F .

COMPUTERS & OPERATIONS RESEARCH, 1986, 13 (05) :533-549

[6]

GLOVER F, 1987, ORSA TIMS M ST LOUIS

[7] USING TABU SEARCH TECHNIQUES FOR GRAPH-COLORING [J].

HERTZ, A ;

DEWERRA, D .

COMPUTING, 1987, 39 (04) :345-351

[8] ON GENERATING ALL MAXIMAL INDEPENDENT SETS [J].

JOHNSON, DS ;

YANNAKAKIS, M ;

PAPADIMITRIOU, CH .

INFORMATION PROCESSING LETTERS, 1988, 27 (03) :119-123

[9]

JOHRI A, 1982, PROBABILISTIC BOUNDS

[10] GRAPH-COLORING ALGORITHM FOR LARGE SCHEDULING PROBLEMS [J].

LEIGHTON, FT .

JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS, 1979, 84 (06) :489-506

← 1 2 →