Applying tabu search to determine new Ramsey graphs
type: Item
instance of: scholarly article
title: Applying tabu search to determine new Ramsey graphs
zbMATH Open document ID: 0851.05079
published in: The Electronic Journal of Combinatorics
publication date: 1996-07-21T00:00:00Z
full work available at URL: https://eudml.org/doc/231599
full work available at URL: R6
review text: 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\).
Mathematics Subject Classification ID: 05C55
zbMATH DE Number: 907631
zbMATH Keywords: tabu search algorithm
zbMATH Keywords: Ramsey graphs
zbMATH Keywords: Ramsey numbers
author: K. Piwakowski
MaRDI profile type: Publication
Recommended article: Some new computer generated results in Ramsey graph theory
Recommended article: Search algorithm for Ramsey graphs by union of group orbits
Recommended article: Using tabu search techniques for graph coloring
Recommended article: Q4519136
Recommended article: Q3976613
Recommended article: Q3490026
Recommended article: Tabu search for graph partitioning
Recommended article: Computation of new diagonal graph Ramsey numbers
Recommended article: Q4495173
Recommended article: Tabu search with simple ejection chains for coloring graphs
description: scientific article; zbMATH DE number 907631