Application of the "descent with mutations" metaheuristic to a clique partitioning problem

2007 IEEE International Conference on Research, Innovation and Vision for the Future, RIVF 2007

Volumn , Issue , 2007, Pages 29-35

  Charon, I ^a   Hudry, O ^a  

^a INSTITUT TELECOM   (France)

Author keywords

Aggregation of symmetric relations into equivalence relations; Clique partitioning of a graph; Combinatorial optimization; Metaheuristics; Noising methods; Simulated annealing

Indexed keywords

COMBINATORIAL OPTIMIZATION; HEURISTIC METHODS; NUMERICAL METHODS; PROBLEM SOLVING; SIMULATED ANNEALING;

CLIQUE PARTITIONING; EQUIVALENCE RELATIONS; METAHEURISTICS; NOISING METHODS;

GRAPH THEORY;

EID: 34250747346     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RIVF.2007.369132     Document Type: Conference Paper

References (26)

1. S.G. de Amorim, J.-P. Barthélemy and C.C. Ribeiro, Clustering and clique partitioning: simulated annealing and tabu search approaches, Journal of Classification 9, 1992, 17-42.
2. J.-P. Barthélemy and B. Leclerc, The median procedure for partitions, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 19, 1995, 3-34.
3. J.-P. Barthélemy, B. Leclerc and B. Monjardet, On the use of ordered sets in problems of comparison and consensus of classifications, Journal of Classification 3, 1986, 187-224.
4. J.-P. Barthélemy and B. Monjardet, The median procedure in cluster analysis and social choice theory, Mathematical Social Sciences 1, 1981, 235-267.
5. J.-P. Barthélemy and B. Monjardet, The median procedure in data analysis: new results and open problems, in Classification and related methods of data analysis, H.H. Bock (ed), North Holland, Amsterdam, 1988.
6. I. Charon and O. Hudry, The noising method: a new combinatorial optimization method, Operations Research Letters 14, 1993, 133-137.
7. I. Charon and O. Hudry, Mixing different components of metaheuristics, in: I.H. Osman and J.P. Kelly (eds), Metaheuristics: Theory and Applications, Kluwer Academic Publishers, Boston, 1996, 589-603.
8. I. Charon and O. Hudry, Lamarckian genetic algorithms applied to the aggregation of preferences, Annals of Operations Research 80, 1998, 281-297.
9. I. Charon and O. Hudry, Application of the noising methods to the Travelling Salesman Problem, European Journal of Operational Research 125 (2), 2000, 266-277.
10. I. Charon and O. Hudry, The noising methods: a generalization of some metaheuristics, European Journal of Operational Research 135 (1), 2001, 86-101.
11. I. Charon and O. Hudry, Noising methods for a clique partitioning problem, Discrete Applied Mathematics 154 (5), 2006, 754-769.
12. Irène Charon, Olivier Hudry, A branch and bound algorithm to solve the linear ordering problem for weighted tournaments, Discrete Applied Mathematics 154, 2097-2116, 2006.
13. I. Charon and O. Hudry, Self-tuning of the noising methods, submitted for publication.
14. B. Debord, Axiomatisation de procédures d'agrégation de préférences, PhD thesis, Grenoble, 1987.
15. K.A. Dowsland, Simulated annealing, in C. Reeves (ed), Modern heuristic techniques for combinatorial problems, McGraw-Hill, London, 1995, 20-69.
16. J. Dréo, A. Petrowski, É. Taillard and P. Siarry, Metaheuristics for Hard Optimization, Methods and Case Studies, Springer, 2006.
17. F.W. Glover and G.A. Kochenberger, Handbook of Metaheuristics, Kluwer Academic Publishers, International series in operations research and management science, Boston Hardbound, 2003.
18. D. Guillaume, F. Murtagh, An application of XML and XLink using a graph partitioning method and a density map for information retrieval and knowledge discovery, in Astronomical Data Analysis Software and Systems VIII, D.M. Mehringer, R.L. Plante and D.A. Roberts (eds), 1999, 278-282.
19. D. Guillaume and F. Murtagh, Clustering of XML documents, Computer Physics Communications 127, 2000, 215-227.
20. P. Hansen and B. Jaumard, Cluster analysis and mathematical programming, Mathematical Programming 79, 1997, 191-215.
21. M. Krivanek and J. Moravek, NP-hard problems in hierarchical-tree clustering, Acta Informatica 23, 1986, 311-323.
22. S. Régnier, Sur quelques aspects mathématiques des problèmes de classification automatique, I.C.C. Bulletin 4, Rome, 1965.
23. V. Sudhakar and C. Siva Ram Murthy, A modified noising method for the graph partitioning problem, Integration, the VLSI Journal 22, 1997, 101-113.
24. Y. Wakabayashi, Aggregation of binary relations: algorithmic and polyhedral investigations, PhD thesis, Augsbourg, 1986.
25. Y. Wakabayashi, The Complexity of Computing Medians of Relations. Resenhas 3 (3), 1998, 323-349.
26. C.T. Zahn, Approximating symmetric relations by equivalence relations, SIAM Journal on Applied Mathematics 12,1964, 840-847.