|
| |
g2b
G2
| variables: |
1000 |
| density: |
30% |
| diagonal
coefficients: |
integer
uniform [0,99] |
| off-diagonal
coefficients: |
integer
uniform [-50,0] |
| starting
seed: |
--- |
| Maximum |
| Value |
Type |
Source |
Method |
Time |
Technology |
| 2,122 |
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 |
--- |
--- |
| 2,050 |
lower bound |
F. Glover, B. Alidaee, C. Rego and G. Kochenberger, (2002), ''One-pass heuristics for large-scale unconstrained binary quadratic problems'', European Journal of Operational Research 137 272-287. |
--- |
--- |
--- |
|
