|
| |
2500-8
OR-LIB
| variables: |
2500 |
| density: |
10% |
| diagonal
coefficients: |
integer
uniform [-100,100] |
| off-diagonal
coefficients: |
integer
uniform [-100,100] |
| starting
seed: |
--- |
| Maximum |
| Value |
Type |
Source |
Method |
Time |
Technology |
| 1,484,199 |
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 |
49861 sec |
Silicon Graphics Indigo (R4000, 100 MHz, 48 MB RAM). |
| 1,484,199 |
lower bound |
G. Palubeckis, (11-24-2003), http://www.soften.ktu.lt/~gintaras/. |
tabu search |
--- |
Pentium II 266 PC. |
| 1,483,702 |
lower bound |
P. Merz and B. Freisleben, (1999), ''Genetic algorithms for binary quadratic programming'', in Proceedings of the 1999 international Genetic and Evolutionary Computation Conference (GECCO'99), Morgan Kauffmann, 417-424. |
genetic algorithms |
1200 sec |
Implemented in C++ and tested on a Pentium II PC (300 MHz) under Solaris 2.6. |
| 1,482,953 |
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 |
61918 sec |
Silicon Graphics Indigo (R4000, 100 MHz, 48 MB RAM). |
|
