|
| |
5a
A
| variables: |
50 |
| density: |
20% |
| diagonal
coefficients: |
integer
uniform [-100,100] |
| off-diagonal
coefficients: |
integer
uniform [-100,100] |
| starting
seed: |
10 |
| Maximum |
| Value |
Type |
Source |
Method |
Time |
Technology |
| 5,737 |
optimal |
F. Glover, G. Kochenberger and B. Alidaee, (1998), ''Adaptative memory tabu search for binary quadratic programs'', Management Science 44(3) 336-345. |
DFS with the Pardalos bound |
--- |
--- |
| 5,737 |
lower bound |
F. Glover, G. Kochenberger and B. Alidaee, (1998), ''Adaptative memory tabu search for binary quadratic programs'', Management Science 44(3) 336-345. |
tabu search |
38 sec |
Pentium 90 PC. |
|
