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

From MaRDI portal
Revision as of 07:54, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
A branch and bound algorithm for the maximum diversity problem
scientific article

    Statements

    title
    A branch and bound algorithm for the maximum diversity problem (English)
    0 references
    author
    Rafael Martí
    0 references
    Micael Gallego
    0 references
    Abraham Duarte
    0 references
    publication date
    19 March 2010
    0 references
    zbMATH DE Number
    5685122
    0 references
    zbMATH Keywords
    maximum diversity problem
    0 references
    branch and bound
    0 references
    integer programming
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2379521&oldid=26915961"
    Powered by MediaWiki