ロード中...
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...
保存先:
| 主要な著者: | , , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
Hindawi Publishing Corporation
2014
|
| 主題: | |
| オンライン･アクセス: | 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 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|