Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem (Q5945202)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1656235
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem |
scientific article; zbMATH DE number 1656235 |
Statements
Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem (English)
0 references
10 October 2001
0 references
heuristics
0 references
local search
0 references
large-size problems
0 references
0 references
0 references
0.8644458651542664
0 references
0.8021899461746216
0 references
0.79841148853302
0 references
0.7854534983634949
0 references
0.7798535823822021
0 references
