An Adaptive Neighborhood Search for k-Clustering Minimum Bi-clique Completion Problems (Q5356965): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710423558064 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-319-18161-5_2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1146855678 / rank | |||
Normal rank | |||
Revision as of 19:51, 19 March 2024
scientific article; zbMATH DE number 6774362
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Adaptive Neighborhood Search for k-Clustering Minimum Bi-clique Completion Problems |
scientific article; zbMATH DE number 6774362 |
Statements
An Adaptive Neighborhood Search for k-Clustering Minimum Bi-clique Completion Problems (English)
0 references
12 September 2017
0 references
bi-clique
0 references
combinatorial optimization
0 references
heuristic
0 references
local search
0 references
