THE NOISING METHOD - A NEW METHOD FOR COMBINATORIAL OPTIMIZATION

被引：84

作者：

CHARON, I

HUDRY, O

机构：

[1] Ecole Nationale Supérieure des Télécommunications, Paris

来源：

OPERATIONS RESEARCH LETTERS | 1993年 / 14卷 / 03期

关键词：

HEURISTICS; COMBINATORIAL OPTIMIZATION; CLIQUE PARTITIONING OF A GRAPH; NP-HARD PROBLEMS;

D O I：

10.1016/0167-6377(93)90023-A

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper presents the principles and the first results of a new combinatorial optimization method that we calf the noising method. It is applied to the NP-hard problem of the clique partitioning of a graph. The results obtained from this problem which are definitely better than those provided by standard iterative-improvement methods and compare favorably with those of simulated annealing, show the relevance of the noising method.

引用

页码：133 / 137

页数：5

共 9 条

[1] ARAGON CR, 1984, WORKSHOP STATISTICAL
[2] BARTHELEMY JP, 1981, MATH SOC SCI, V1, P235
[3] THE N-CITY TRAVELING SALESMAN PROBLEM - STATISTICAL-MECHANICS AND THE METROPOLIS ALGORITHM
BONOMI, E
LUTTON, JL
[J]. SIAM REVIEW, 1984, 26 (04) : 551 - 568
[4] CLUSTERING AND CLIQUE PARTITIONING - SIMULATED ANNEALING AND TABU SEARCH APPROACHES
DEAMORIM, SG
BARTHELEMY, JP
RIBEIRO, CC
[J]. JOURNAL OF CLASSIFICATION, 1992, 9 (01) : 17 - 41
[5] Garey M. R., 1979, COMPUTERS INTRACTABI
[6] NP-HARD PROBLEMS IN HIERARCHICAL-TREE CLUSTERING
KRIVANEK, M
MORAVEK, J
[J]. ACTA INFORMATICA, 1986, 23 (03) : 311 - 323
[7] Laarhoven P. J. M., 1987, SIMULATED ANNEALING
[8] REGNIER S, 1965, ICC B, V4, P85
[9] WAKABAYASHI Y, 1986, THESIS U ANGSBOURG

← 1 →