Algorithms for minclique scheduling problems (Q5961609)

From MaRDI portal
Revision as of 09:50, 27 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 981906
Language Label Description Also known as
English
Algorithms for minclique scheduling problems
scientific article; zbMATH DE number 981906

    Statements

    title
    Algorithms for minclique scheduling problems (English)
    0 references
    author
    Bernd Jurisch
    0 references
    Wiesław X. Kubiak
    0 references
    Joanna Józefowska
    0 references
    publication date
    25 February 1997
    0 references
    zbMATH Keywords
    spectral algorithms
    0 references
    tabu search
    0 references
    scheduling problems
    0 references
    minimum weighted clique
    0 references
    complete weighted graph
    0 references
    negative weights
    0 references
    self-loops
    0 references

    Identifiers

    zbMATH DE Number
    981906
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5961609&oldid=34174978"
    Powered by MediaWiki