On bilevel machine scheduling problems (Q421065)

From MaRDI portal
Revision as of 07:03, 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
On bilevel machine scheduling problems
scientific article

    Statements

    title
    On bilevel machine scheduling problems (English)
    0 references
    author
    Tamás Kis
    0 references
    András Kovács
    0 references
    published in
    OR Spectrum
    0 references
    publication date
    23 May 2012
    0 references
    Mathematics Subject Classification ID
    90B35
    0 references
    90C05
    0 references
    90C59
    0 references
    zbMATH DE Number
    6038001
    0 references
    zbMATH Keywords
    scheduling
    0 references
    bilevel optimisation
    0 references
    max \(m\)-cut
    0 references
    linear programming
    0 references
    approximation algorithms
    0 references
    OpenAlex ID
    W2141594462
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q421065&oldid=35280902"
    Powered by MediaWiki