Using precedence intervals to solve constrained precedence problems (Q3659515)

From MaRDI portal
Revision as of 08:54, 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
Using precedence intervals to solve constrained precedence problems
scientific article

    Statements

    title
    Using precedence intervals to solve constrained precedence problems (English)
    0 references
    author
    A. E. Serik
    0 references
    published in
    Cybernetics
    0 references
    publication date
    1982
    0 references
    zbMATH Keywords
    sequencing
    0 references
    precedence problems
    0 references
    strict order binary relation
    0 references
    permutation
    0 references
    acyclic directed graph
    0 references
    precedence intervals
    0 references
    optimal solution
    0 references

    Identifiers

    DOI
    10.1007/BF01078676
    0 references
    zbMATH DE Number
    3811296
    0 references
    OpenAlex ID
    W2046692263
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3659515&oldid=36968735"
    Powered by MediaWiki