Applying tabu search to determine new Ramsey graphs (Q1918865)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Applying tabu search to determine new Ramsey graphs |
scientific article; zbMATH DE number 907631
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Applying tabu search to determine new Ramsey graphs |
scientific article; zbMATH DE number 907631 |
Statements
Applying tabu search to determine new Ramsey graphs (English)
0 references
21 July 1996
0 references
Summary: 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\).
0 references
tabu search algorithm
0 references
Ramsey graphs
0 references
Ramsey numbers
0 references
0.8708102
0 references
0.8652566
0 references
0.86457986
0 references
0 references
0.85562605
0 references
0.85143346
0 references
