Maximum cut-clique problem: ILS heuristics and a data analysis application (Q2806429)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Maximum cut-clique problem: ILS heuristics and a data analysis application |
scientific article; zbMATH DE number 6581521
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum cut-clique problem: ILS heuristics and a data analysis application |
scientific article; zbMATH DE number 6581521 |
Statements
Maximum cut-clique problem: ILS heuristics and a data analysis application (English)
0 references
18 May 2016
0 references
cut cliques
0 references
clique's edge neighborhood
0 references
iterated local search heuristics
0 references
discretized formulations
0 references
market basket analysis
0 references
data mining
0 references
0 references
0.7443519234657288
0 references
0.7396212816238403
0 references
0.7384942173957825
0 references
0.7368326187133789
0 references
0.7365975975990295
0 references
