A characterization of the weighted version of McEliece–Rodemich–Rumsey–Schrijver number based on convex quadratic programming (Q2788727): 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 / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding independent sets in a graph using continuous multivariable polynomial formulations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplex like approach based on star sets for recognizing convex-\(QP\) adverse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of the Stability Number of a Graph via Copositive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxations of vertex packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / 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 generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic programming approach to the determination of an upper bound on the weighted stability number / 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: Q4194987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima for Graphs and a New Proof of a Theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of the Delsarte and Lovász bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review on algorithms for maximum clique problems / rank
 
Normal rank

Latest revision as of 11:57, 11 July 2024

scientific article
Language Label Description Also known as
English
A characterization of the weighted version of McEliece–Rodemich–Rumsey–Schrijver number based on convex quadratic programming
scientific article

    Statements

    A characterization of the weighted version of McEliece–Rodemich–Rumsey–Schrijver number based on convex quadratic programming (English)
    0 references
    0 references
    22 February 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Lovász number
    0 references
    McEliece-Rodemich-Rumsey-Schrijver number
    0 references
    maximum weight stable set
    0 references
    combinatorial optimization
    0 references
    quadratic programming
    0 references