New facets and a branch-and-cut algorithm for the weighted clique problem. (Q1420411): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(02)00852-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2044024461 / rank
 
Normal rank

Latest revision as of 09:09, 30 July 2024

scientific article
Language Label Description Also known as
English
New facets and a branch-and-cut algorithm for the weighted clique problem.
scientific article

    Statements

    New facets and a branch-and-cut algorithm for the weighted clique problem. (English)
    0 references
    2 February 2004
    0 references
    Combinatorial optimization
    0 references
    Boolean quadratic problem
    0 references
    Edge-weighted clique
    0 references
    problem
    0 references
    Maximum dispersion problem
    0 references
    Polyhedra
    0 references

    Identifiers