Solving unconstrained binary quadratic programming problem by global equilibrium search (Q464982)
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: Solving unconstrained binary quadratic programming problem by global equilibrium search |
scientific article; zbMATH DE number 6362616
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving unconstrained binary quadratic programming problem by global equilibrium search |
scientific article; zbMATH DE number 6362616 |
Statements
Solving unconstrained binary quadratic programming problem by global equilibrium search (English)
0 references
30 October 2014
0 references
binary quadratic programming
0 references
approximate methods
0 references
global equilibrium search
0 references
computational experiment
0 references
comparative analysis of algorithms
0 references
0 references
0 references
0 references
0.8807482719421387
0 references
0.786500096321106
0 references
0.7752867341041565
0 references
0.7738663554191589
0 references
0.7729737162590027
0 references
