|
| |
7c
C
| variables: |
100 |
| density: |
10% |
| diagonal
coefficients: |
integer
uniform [-100,100] |
| off-diagonal
coefficients: |
integer
uniform [-50,50] |
| starting
seed: |
142 |
| Maximum |
| Value |
Type |
Source |
Method |
Time |
Technology |
| 7,225 |
optimal |
P.M. Pardalos and G.P. Rodgers, (1990), Computational aspects of a branch and bound algorithm for quadratic 0-1 programming", Computing 45 , pp. 131-144. |
DFS with the Pardalos bound |
--- |
--- |
| 7,225 |
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 |
140 sec |
Pentium 90 PC. |
|
