Maximum cut-clique problem: ILS heuristics and a data analysis application (Q2806429): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: DIMACS / rank | |||
Normal rank | |||
Revision as of 08:39, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum cut-clique problem: ILS heuristics and a data analysis application |
scientific article |
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
