A three-phased local search approach for the clique partitioning problem (Q306093)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6620838
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A three-phased local search approach for the clique partitioning problem |
scientific article; zbMATH DE number 6620838 |
Statements
A three-phased local search approach for the clique partitioning problem (English)
0 references
31 August 2016
0 references
clique partitioning
0 references
restricted neighborhood
0 references
tabu search
0 references
direct perturbation
0 references
heuristic
0 references
0 references
0.7704740166664124
0 references
0.7632632851600647
0 references
0.7464222311973572
0 references
0.7435651421546936
0 references
0.7391924262046814
0 references
