Logo PUC-Rio Logo Maxwell
ETDs @PUC-Rio
Título: NEW HEURISTICS FOR THE PROBLEM OF CLIQUE PARTITIONING OF GRAPHS
Autor: SAUL GUALBERTO DE AMORIM JUNIOR
Colaborador(es): CELSO DA CRUZ CARNEIRO RIBEIRO - Orientador
Catalogação: 10/MAI/2007 Língua(s): PORTUGUESE - BRAZIL
Tipo: TEXT Subtipo: THESIS
Notas: [pt] Todos os dados constantes dos documentos são de inteira responsabilidade de seus autores. Os dados utilizados nas descrições dos documentos estão em conformidade com os sistemas da administração da PUC-Rio.
[en] All data contained in the documents are the sole responsibility of the authors. The data used in the descriptions of the documents are in conformity with the systems of the administration of PUC-Rio.
Referência(s): [pt] https://www.maxwell.vrac.puc-rio.br/projetosEspeciais/ETDs/consultas/conteudo.php?strSecao=resultado&nrSeq=9882&idi=1
[en] https://www.maxwell.vrac.puc-rio.br/projetosEspeciais/ETDs/consultas/conteudo.php?strSecao=resultado&nrSeq=9882&idi=2
DOI: https://doi.org/10.17771/PUCRio.acad.9882
Resumo:
The clique partitioning problem arise very often in many fields as Social Science, Economics, Biology, Cluster analysis and in all other fields that need a classification of elements. The main exact algorithms and heuristics that appear in the literature are studied. A especial class of instances of the clique partitioning problem for which the most comonly used heuristics perform arbitrarily bad is exhibited. Four new heuristics are presented and two of them are based on the known simulated anneling and tabu search methods. They are analised by their application to test-problems, real-life-problems and to the special class of instances mentioned above
Descrição: Arquivo:   
COVER, ACKNOWLEDGEMENTS, RESUMO, ABSTRACT, SUMMARY AND LISTS PDF      
CHAPTER 1 PDF      
CHAPTER 2 PDF      
CHAPTER 3 PDF      
CHAPTER 4 PDF      
CHAPTER 5 PDF      
CHAPTER 6 PDF      
APPENDICES PDF      
REFERENCES PDF