Less is more: tabu search for Bipartite Qudratic Programming problem (Q2181776): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-030-22629-9_27 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2950233525 / rank | |||
Normal rank | |||
Latest revision as of 14:25, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Less is more: tabu search for Bipartite Qudratic Programming problem |
scientific article |
Statements
Less is more: tabu search for Bipartite Qudratic Programming problem (English)
0 references
19 May 2020
0 references
discrete optimization
0 references
graphs
0 references
bipartite quadratic programming
0 references
tabu search
0 references
variable neighborhood search
0 references
