A heuristic for the stability number of a graph based on convex quadratic programming and tabu search (Q844531): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2157797797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the independence number via the \(\vartheta\)-function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two numerical methods for optimizing matrix stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum stable set formulations and heuristics based on continuous optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Experience with Stable Set Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of descent for nondifferentiable optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sandwich theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the independence number of a graph computable in polynomial-time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Convex Quadratic Characterization of the Lovász Theta Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extracting maximum stable sets in perfect graphs using Lovász's theta function / rank
 
Normal rank

Latest revision as of 10:05, 2 July 2024

scientific article
Language Label Description Also known as
English
A heuristic for the stability number of a graph based on convex quadratic programming and tabu search
scientific article

    Statements

    A heuristic for the stability number of a graph based on convex quadratic programming and tabu search (English)
    0 references
    0 references
    0 references
    19 January 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references