Tabu search for graph partitioning (Q1919841)

From MaRDI portal
Revision as of 13:44, 24 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Tabu search for graph partitioning
scientific article

    Statements

    title
    Tabu search for graph partitioning (English)
    0 references
    DOI
    10.1007/BF02125455
    0 references
    author
    Erik Rolland
    0 references
    Hasan Pirkul
    0 references
    Fred Glover
    0 references
    publication date
    25 November 1996
    0 references
    Mathematics Subject Classification ID
    90C35
    0 references
    90B35
    0 references
    90B06
    0 references
    zbMATH DE Number
    910205
    0 references
    zbMATH Keywords
    tabu search procedure
    0 references
    uniform graph partitioning
    0 references
    flow shop scheduling
    0 references
    vehicle rounting
    0 references
    quadratic assignment
    0 references
    maximum satisfiability
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1919841&oldid=34165111"
    Powered by MediaWiki