An Iterated Tabu Search Approach for the Clique Partitioning Problem

Given an edge-weighted undirected graph with weights specifying dissimilarities between pairs of objects, represented by the vertices of the graph, the clique partitioning problem (CPP) is to partition the vertex set of the graph into mutually disjoint subsets such that the sum of the edge weights o...

Descripción completa

Detalles Bibliográficos
Autores principales: Palubeckis, Gintaras, Ostreika, Armantas, Tomkevičius, Arūnas
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi Publishing Corporation 2014
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3967401/
https://www.ncbi.nlm.nih.gov/pubmed/24737968
http://dx.doi.org/10.1155/2014/353101

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3967401/
https://www.ncbi.nlm.nih.gov/pubmed/24737968
http://dx.doi.org/10.1155/2014/353101

Ejemplares similares