A New Approach to the Stable Set Problem Based on Ellipsoids (Q3009765): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-20807-2_18 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1515168927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coefficient strengthening: a tool for reformulating mixed-integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for graph coloring and maximal clique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxation for nonconvex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON GROTSCHEL-LOVASZ-SCHRIJVER'S RELAXATION OF STABLE SET POLYTOPES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring the relationship between max-cut and stable set relaxations / 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: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768040 / 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: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of set packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut solver for the maximum stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the maximum cardinality stable set problem / 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: On the Slater condition for the SDP relaxations of nonconvex sets / rank
 
Normal rank

Latest revision as of 05:43, 4 July 2024

scientific article
Language Label Description Also known as
English
A New Approach to the Stable Set Problem Based on Ellipsoids
scientific article

    Statements

    A New Approach to the Stable Set Problem Based on Ellipsoids (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 June 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    stable set problem
    0 references
    semidefinite programming
    0 references
    convex quadratic programming
    0 references
    cutting planes
    0 references
    0 references
    0 references