|
| |
b-1000-25-8
Large
| variables: |
1000 |
| density: |
25% |
| diagonal
coefficients: |
integer
uniform [1,100] |
| off-diagonal
coefficients: |
integer
uniform [-100,-1] |
| starting
seed: |
4108 |
| Maximum |
| Value |
Type |
Source |
Method |
Time |
Technology |
| 2,359 |
lower bound |
E. Boros, P. L. Hammer and G. Tavares, (2005), "Local search heuristics for unconstrained quadratic binary optimization", RUTCOR Research Report, Rutgers University. |
random search + MSTS |
--- |
--- |
|
