Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Franz Rendl / rank
Normal rank
 
Property / author
 
Property / author: Franz Rendl / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SDPLR / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: COL / 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/s10107-006-0026-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2144606698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Lift-and-Project Relaxations of Binary Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semidefinite programming-based heuristic for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositive programming motivated bounds on the stability and the chromatic numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry groups, semidefinite programs, and sums of squares / 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: Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Bundle Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using tabu search techniques for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate graph coloring by semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sandwich theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5292090 / 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: A boundary point method to solve semidefinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-complete problems in quadratic and nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4428719 / 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: New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Some Large Scale Semidefinite Programs via the Conjugate Residual Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bound on the Shannon capacity of \(C_7\) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:27, 25 June 2024

scientific article
Language Label Description Also known as
English
Semidefinite programming relaxations for graph coloring and maximal clique problems
scientific article

    Statements

    Semidefinite programming relaxations for graph coloring and maximal clique problems (English)
    0 references
    0 references
    0 references
    5 March 2007
    0 references
    Lovász theta number
    0 references
    chromatic number
    0 references
    clique number
    0 references
    cutting planes
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references