|
| |
1d
D
| variables: |
100 |
| density: |
10% |
| diagonal
coefficients: |
integer
uniform [-75,75] |
| off-diagonal
coefficients: |
integer
uniform [-50,50] |
| starting
seed: |
31 |
| Maximum |
| Value |
Type |
Source |
Method |
Time |
Technology |
| 6,333 |
optimal |
E. Boros, P. L. Hammer and G. Tavares, (2005), "Exact methods for unconstrained quadratic binary optimization", work currently underway, RUTCOR, Rutgers University. |
--- |
--- |
--- |
| 6,333 |
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 |
60 sec |
Pentium 90 PC. |
|
