The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations (Q1569939): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new classes of facets for the equicut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting-plane approach to the edge-weighted maximal clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3753826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-cut clustering / 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
Property / cites work
 
Property / cites work: An extended formulation approach to the edge-weighted maximal clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs / rank
 
Normal rank

Latest revision as of 11:31, 30 May 2024

scientific article
Language Label Description Also known as
English
The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
scientific article

    Statements

    The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations (English)
    0 references
    7 June 2001
    0 references
    0 references
    0 references
    0 references
    0 references
    edge-weighted cliques
    0 references
    polyhedral combinatorics
    0 references
    integer programming
    0 references
    branch-and-cut
    0 references
    Boolean quadric polytope
    0 references