Multiple-Machine Lower Bounds for Shop-Scheduling Problems (Q2884494)

From MaRDI portal
Revision as of 03:32, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Multiple-Machine Lower Bounds for Shop-Scheduling Problems
scientific article

    Statements

    title
    Multiple-Machine Lower Bounds for Shop-Scheduling Problems (English)
    0 references
    author
    Francis Sourd
    0 references
    Wim Nuijten
    0 references
    publication date
    30 May 2012
    0 references
    Mathematics Subject Classification ID
    90B35
    0 references
    68M20
    0 references
    90C10
    0 references
    68W40
    0 references
    zbMATH DE Number
    6039045
    0 references
    zbMATH Keywords
    integer programming
    0 references
    branch and bound
    0 references
    OpenAlex ID
    W2163942338
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2884494&oldid=33017376"
    Powered by MediaWiki