A branch and bound algorithm for the maximum diversity problem (Q2379521)

From MaRDI portal
Revision as of 21:00, 3 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A branch and bound algorithm for the maximum diversity problem
scientific article

    Statements

    A branch and bound algorithm for the maximum diversity problem (English)
    0 references
    0 references
    0 references
    0 references
    19 March 2010
    0 references
    0 references
    maximum diversity problem
    0 references
    branch and bound
    0 references
    integer programming
    0 references