A semidefinite programming hierarchy for packing problems in discrete geometry (Q2349135): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: kepler98 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2095694172 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1311.3789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur la séparation des ensembles convexes / 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: Hadamard determinants Möbius functions, and the chromatic number of a graph / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 06:18, 10 July 2024

scientific article
Language Label Description Also known as
English
A semidefinite programming hierarchy for packing problems in discrete geometry
scientific article

    Statements

    A semidefinite programming hierarchy for packing problems in discrete geometry (English)
    0 references
    0 references
    0 references
    19 June 2015
    0 references
    Lasserre hierarchy
    0 references
    weighted independence number (stability number)
    0 references
    infinite graphs
    0 references
    geometric packing problems
    0 references
    moment measures
    0 references

    Identifiers