Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem (Q337120)
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: Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem |
scientific article; zbMATH DE number 6650704
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem |
scientific article; zbMATH DE number 6650704 |
Statements
Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem (English)
0 references
10 November 2016
0 references
quadratic programming
0 references
branch and bound
0 references
heuristic search
0 references
tabu search
0 references
iterated local search
0 references
0 references
0 references
0.82000732421875
0 references
0.814091682434082
0 references
0.7980433106422424
0 references
0.7675901055335999
0 references
0.7665419578552246
0 references
