Improving spectral bounds for clustering problems by Lagrangian relaxation (Q4918244): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q923194
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Zahra Afsharnejad / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ARPACK / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Biq Mac / 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.1111/j.1475-3995.2011.00825.x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2127872150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identification of network modules by optimization of ratio association / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: TRANSPORT IN DYNAMICAL ASTRONOMY AND MULTIBODY PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cut polytope and the Boolean quadric polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4266495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior Point Algorithm for Minimum Sum-of-Squares Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting and Locating Near-Optimal Almost-Invariant Sets and Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5708363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ARPACK Users' Guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Nonperiodic Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5316730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating K‐means‐type Clustering via Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5701392 / rank
 
Normal rank

Latest revision as of 10:04, 6 July 2024

scientific article; zbMATH DE number 6156971
Language Label Description Also known as
English
Improving spectral bounds for clustering problems by Lagrangian relaxation
scientific article; zbMATH DE number 6156971

    Statements

    Improving spectral bounds for clustering problems by Lagrangian relaxation (English)
    0 references
    0 references
    0 references
    0 references
    24 April 2013
    0 references
    minimum sum-of-squares clustering
    0 references
    ratio association problem
    0 references
    subgradient optimization
    0 references
    spectral bounds
    0 references
    0 references
    0 references

    Identifiers