|
| |
50-9
OR-LIB
| variables: |
50 |
| density: |
10% |
| diagonal
coefficients: |
integer
uniform [-100,100] |
| off-diagonal
coefficients: |
integer
uniform [-100,100] |
| starting
seed: |
--- |
| Maximum |
| Value |
Type |
Source |
Method |
Time |
Technology |
| 3,780 |
optimal |
E. Boros, P. L. Hammer and G. Tavares, (2005), "Exact methods for unconstrained quadratic binary optimization", work currently underway, RUTCOR, Rutgers University. |
--- |
--- |
--- |
| 3,780 |
lower bound |
J. E. Beasley, (1998), ''Heuristic algorithms for the unconstrained binary quadratic programming problem'', Technical Report, Management School, Imperial College, London, UK. |
tabu search |
17 sec |
Silicon Graphics Indigo (R4000, 100 MHz, 48 MB RAM). |
| 3,780 |
lower bound |
J. E. Beasley, (1998), ''Heuristic algorithms for the unconstrained binary quadratic programming problem'', Technical Report, Management School, Imperial College, London, UK. |
simulated annealing |
22 sec |
Silicon Graphics Indigo (R4000, 100 MHz, 48 MB RAM). |
|
