Noising methods for a clique partitioning problem

Discrete Applied Mathematics

Volumn 154, Issue 5 SPEC. ISS., 2006, Pages 754-769

  Charon, Irène ^a   Hudry, Olivier ^a  

^a TELECOM PARISTECH   (France)

Author keywords

Aggregation of relations; Classification; Clique partitioning of a weighted graph; Clustering; Metaheuristics; Noising methods; R gnier's problem; Simulated annealing; Threshold accepting algorithms; Zahn's problem

Indexed keywords

ALGORITHMS; DATA REDUCTION; HEURISTIC METHODS; PROBLEM SOLVING; SIMULATED ANNEALING;

AGGREGATION OF RELATIONS; CLASSIFICATION; CLUSTERING; ZAHN'S PROBLEM;

GRAPH THEORY;

EID: 33644590202     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.05.029     Document Type: Article

References (35)

1. E.H.L. Aarts, J.K. Lenstra (Eds.), Local Search in Combinatorial Optimization. Wiley, New York, 1997.
2. J.-P. Barthélemy, B. Leclerc, The median procedure for partitions, in: I. Cox, P. Hansen, B. Julesz (Eds.), Partitioning Data Sets, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 19, 1995, pp. 3-34.
3. J.-P. Barthélemy, and B. Monjardet The median procedure in cluster analysis and social choice theory Math. Soc. Sci. 1 1981 235 267
4. J.-P. Barthélemy, and B. Monjardet The median procedure in data analysis: new results and open problems H.H. Bock Classification and Related Methods of Data Analysis 1988 North-Holland Amsterdam 309 316
5. J.-C. Borda, Mémoire sur les élections au scrutin, Histoire de l'Académie royale des Sciences pour 1781, Paris, 1784.
6. S.A. Canuto, M.G.C. Resende, and C.C. Ribeiro Local search with perturbations for the prize-collecting Steiner tree problem in graphs Networks 38 2001 50 58; a preliminary version appeared in the Proceedings of the Third Metaheuristics International Conference, Angra dos Reis, Brazil, 1999, pp. 115-119
7. I. Charon, and O. Hudry The noising method: a new combinatorial optimization method Oper. Res. Lett. 14 1993 133 137
8. I. Charon, O. Hudry, Variations on the noising schemes for a clustering problem, Proceedings of the Third Metaheuristics International Conference, Angra dos Reis, Brazil, 1999, pp. 147-150.
9. I. Charon, and O. Hudry Application of the noising method to the Travelling Salesman Problem European J. Oper. Res. 125 2000 266 277
10. I. Charon, and O. Hudry The noising methods: a survey P. Hansen C.C. Ribeiro Essays and Surveys in Metaheuristics 2001 Kluwer Academic Publishers Dordrecht 245 262
11. I. Charon, O. Hudry, Self-tuning of the noising methods, submitted for publication.
12. M.J.A.N. Condorcet, Caritat, marquis de Essai sur l'application de l'analyse à la probabilité des décisions rendues à la pluralité des voix, Paris, 1785.
13. A.H. Copeland, A 'reasonable' social welfare function, Seminar on Applications of Mathematics to Social Sciences, University of Michigan, USA, 1951.
14. S.G. De Amorim, J.-P. Barthélemy, and C.C. Ribeiro Clustering and clique partitioning: simulated annealing and tabu search approaches J. Classification 9 1992 17 42
15. K.A. Dowsland Simulated annealing C.R. Reeves Modern Heuristic Techniques for Combinatorial Problems 1995 McGraw-Hill London 20 69
16. G. Dueck, and T. Scheurer Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing J. Comput. Phys. 90 1990 161 175
17. G. Dueck, J. Wirsching, Threshold accepting algorithms for multi-constraint 0-1 knapsack problems, Technical paper TR 89 10 016, IBM Heidelberg Scientific Center, Heidelberg, 1989.
18. M.B. Eisen, P.T. Spellman, P.O. Brown, and D. Botstein Cluster analysis and display of genome-wide expression patterns Proc. Natl. Acad. Sci. USA 95 25 1998 14863 14868
19. F.W. Glover, and G.A. Kochenberger Handbook of Metaheuristics 2003 Kluwer Academic Publishers Boston
20. A. Guénoche, F. Denizot, Stratégie de séquenç age par ordonnancement de contigs, submitted for publication.
21. 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: D.M. Mehringer, R.L. Plante, D.A. Roberts (Eds.), Astronomical Data Analysis Software and Systems VIII, ASP Conference Series, vol. 172, San Francisco, 1999, p. 278.
22. D. Guillaume, and F. Murtagh Clustering of XML documents Comput. Phys. Commun. 127 2000 215 227
23. P. Hansen, and B. Jaumard Cluster analysis and mathematical programming Math. Programming 79 1997 191 215
24. P. Hansen, C.C. Ribeiro (Eds.), Essays and Surveys in Metaheuristics, Kluwer Academic Publishers, Boston, 2001.
25. J.G. Kemeny Mathematics without numbers Daedalus 88 1959 577 591
26. M. Krivanek, and J. Moravek NP-hard problems in hierarchical-tree clustering Acta Informatica 23 1986 311 323
27. G. Laporte, and I.H. Osman Metaheuristics: a bibliography Ann. Oper. Res. 63 1996 513 623
28. I.H. Osman, J.P. Kelly (Eds.), Meta-heuristics: Theory and Applications, Kluwer Academic Publishers, Boston, 1996.
29. C.R. Reeves (Ed.) Modern Heuristic Techniques for Combinatorial Problems, McGraw-Hill, London, 1995.
30. S. Régnier Sur quelques aspects mathématiques des problèmes de classification automatique I.C.C. Bull. 4 1965 85 111
31. V. Sudhakar, and C. Siva Ram Murthy A modified noising algorithm for the graph partitioning problem Integration VLSI J. 22 1997 101 113
32. S. Voss, S. Martello, I.H. Osman, C. Roucairol, (Eds.), Metaheuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer Academic Publishers, Boston, 1998.
33. Y. Wakabayashi, Aggregation of binary relations: algorithmic and polyhedral investigations, Ph.D. Thesis, Augsbourg, 1986.
34. Y. Wakabayashi The Complexity of Computing Medians of Relations Resenhas 3 3 1998 323 349
35. C.T. Zahn Approximating symmetric relations by equivalence relations SIAM J. Appl. Math. 12 1964 840 847