Geodesic
Applying tabu search to determine new Ramsey graphs
The electronic journal of combinatorics, Tome 3 (1996) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

In this note an adaptation of heuristic tabu search algorithm for finding Ramsey graphs is presented. As a result, seven new lower bounds for classical Ramsey numbers are established: $R(3,13)\geq 59$, $R(4,10)\geq 80$, $R(4,11)\geq 96$, $R(4,12)\geq 106$, $R(4,13)\geq 118$, $R(4,14)\geq 129$, and $R(5,8)\geq 95$.
DOI : 10.37236/1230
Classification : 05C55
Mots-clés : tabu search algorithm, Ramsey graphs, Ramsey numbers 
@article{10_37236_1230,
     author = {Konrad Piwakowski},
     title = {Applying tabu search to determine new {Ramsey} graphs},
     journal = {The electronic journal of combinatorics},
     year = {1996},
     volume = {3},
     number = {1},
     doi = {10.37236/1230},
     zbl = {0851.05079},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1230/}
}
TY  - JOUR
AU  - Konrad Piwakowski
TI  - Applying tabu search to determine new Ramsey graphs
JO  - The electronic journal of combinatorics
PY  - 1996
VL  - 3
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1230/
DO  - 10.37236/1230
ID  - 10_37236_1230
ER  - 
%0 Journal Article
%A Konrad Piwakowski
%T Applying tabu search to determine new Ramsey graphs
%J The electronic journal of combinatorics
%D 1996
%V 3
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1230/
%R 10.37236/1230
%F 10_37236_1230
Konrad Piwakowski. Applying tabu search to determine new Ramsey graphs. The electronic journal of combinatorics, Tome 3 (1996) no. 1. doi: 10.37236/1230

Cité par Sources :