A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
type: Item
instance of: scholarly article
title: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
zbMATH Open document ID: 0815.90121
author: Thomas A. Feo
author: Stuart H. Smith
author: Mauricio G. C. Resende
published in: Operations Research
publication date: 1995-01-12T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 710932
zbMATH Keywords: randomized heuristic
zbMATH Keywords: maximum independent set
zbMATH Keywords: randomly generated graphs
zbMATH Keywords: simulated annealing
zbMATH Keywords: tabu search
zbMATH Keywords: exact partial enumeration
MaRDI profile type: MaRDI publication profile
full work available at URL: opre.42.5.860
OpenAlex ID: W2117942072
DOI: 10.1287/OPRE.42.5.860
Recommended article: Greedy randomized adaptive search procedures
Recommended article: Fast local search for the maximum independent set problem
Recommended article: Experimental and Efficient Algorithms
Recommended article: Q4938679
Recommended article: Q4321558
description: scientific article; zbMATH DE number 710932