A heuristic for the stability number of a graph based on convex quadratic programming and tabu search
DOI10.1007/S10958-009-9613-XzbMATH Open1216.05099OpenAlexW2157797797MaRDI QIDQ844531FDOQ844531
Authors: Luís Cavique, Carlos J. Luz 
Publication date: 19 January 2010
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10400.2/1901
Recommendations
- A Convex Quadratic Characterization of the Lovász Theta Number
- Improving an upper bound on the stability number of a graph
- A quadratic programming approach to the determination of an upper bound on the weighted stability number
- Applications of the Inverse Theta Number in Stable Set Problems
- An SDP-based approach for computing the stability number of a graph
Quadratic programming (90C20) Convex programming (90C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Maximum stable set formulations and heuristics based on continuous optimization
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Title not available (Why is that?)
- Approximation algorithms for combinatorial problems
- Geometric algorithms and combinatorial optimization
- Methods of descent for nondifferentiable optimization
- On the Shannon capacity of a graph
- The sandwich theorem
- Title not available (Why is that?)
- Approximating the independence number via the \(\vartheta\)-function
- Two numerical methods for optimizing matrix stability
- Computational Experience with Stable Set Relaxations
- An upper bound on the independence number of a graph computable in polynomial-time
- A Convex Quadratic Characterization of the Lovász Theta Number
- On extracting maximum stable sets in perfect graphs using Lovász's theta function
- A scatter search algorithm for the maximum clique problem
- Title not available (Why is that?)
Cited In (6)
- Extended and discretized formulations for the maximum clique problem
- A Convex Quadratic Characterization of the Lovász Theta Number
- A quadratic programming approach to the determination of an upper bound on the weighted stability number
- A survey on graphs with convex quadratic stability number
- Maximum stable set formulations and heuristics based on continuous optimization
- An SDP-based approach for computing the stability number of a graph
Uses Software
This page was built for publication: A heuristic for the stability number of a graph based on convex quadratic programming and tabu search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844531)
