An efficient memetic algorithm for the graph partitioning problem (Q763098)

From MaRDI portal
Revision as of 00:13, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An efficient memetic algorithm for the graph partitioning problem
scientific article

    Statements

    title
    An efficient memetic algorithm for the graph partitioning problem (English)
    0 references
    author
    Philippe Galinier
    0 references
    Zied Boujbel
    0 references
    publication date
    9 March 2012
    0 references
    zbMATH DE Number
    6013345
    0 references
    OpenAlex ID
    W1999993900
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q763098&oldid=35268753"
    Powered by MediaWiki