A heuristic for the stability number of a graph based on convex quadratic programming and tabu search
type: Item
instance of: scholarly article
title: A heuristic for the stability number of a graph based on convex quadratic programming and tabu search
zbMATH Open document ID: 1216.05099
author: Luís Cavique
author: Carlos J. Luz
published in: Journal of Mathematical Sciences (New York)
publication date: 2010-01-19T00:00:00Z
full work available at URL: http://hdl.handle.net/10400.2/1901
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 5660171
describes a project that uses: GradSamp
describes a project that uses: Tabu search
describes a project that uses: Scatter Search
MaRDI profile type: Publication
OpenAlex ID: W2157797797
cites work: Q3138953
cites work: Approximating the independence number via the \(\vartheta\)-function
cites work: Two numerical methods for optimizing matrix stability
cites work: A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
cites work: Maximum stable set formulations and heuristics based on continuous optimization
cites work: Q3996569
cites work: A scatter search algorithm for the maximum clique problem
cites work: Geometric algorithms and combinatorial optimization
cites work: Computational Experience with Stable Set Relaxations
cites work: Approximation algorithms for combinatorial problems
cites work: Methods of descent for nondifferentiable optimization
cites work: The sandwich theorem
cites work: On the Shannon capacity of a graph
cites work: An upper bound on the independence number of a graph computable in polynomial-time
cites work: A Convex Quadratic Characterization of the Lovász Theta Number
cites work: Q4144192
cites work: On extracting maximum stable sets in perfect graphs using Lovász's theta function
DOI: 10.1007/S10958-009-9613-X
description: scientific article; zbMATH DE number 5660171