A carregar...
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...
Na minha lista:
| Main Authors: | , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Hindawi Publishing Corporation
2014
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3967401/ https://ncbi.nlm.nih.gov/pubmed/24737968 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1155/2014/353101 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|