Min-cut clustering (Q1321669): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Graph Partitioning Polytope on Series-Parallel and 4-Wheel Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equipartition polytope. I: Formulations, dimension and basic facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equipartition polytope. II: Valid inequalities and facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for a clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the clique partitioning polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral approach to edge coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean quadratic polytope: Some characteristics, facets and relatives / rank
 
Normal rank

Revision as of 14:20, 22 May 2024

scientific article
Language Label Description Also known as
English
Min-cut clustering
scientific article

    Statements

    Min-cut clustering (English)
    0 references
    0 references
    0 references
    0 references
    28 April 1994
    0 references
    subproblem optimization
    0 references
    compiler design
    0 references
    decomposition
    0 references
    column generation scheme
    0 references
    min-cut clustering
    0 references
    NP-hard mixed integer programming
    0 references
    strong valid inequalities
    0 references

    Identifiers