The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine (Q1951910)

From MaRDI portal
Revision as of 10:11, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine
scientific article

    Statements

    title
    The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine (English)
    0 references
    publication date
    24 May 2013
    0 references

    Identifiers

    Mathematics Subject Classification ID
    49N90
    0 references
    93C85
    0 references
    68M20
    0 references
    zbMATH DE Number
    6166389
    0 references
    OpenAlex ID
    W2129008451
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1951910&oldid=37230687"
    Powered by MediaWiki