Solving Project Scheduling Problems by Minimum Cut Computations (Q3114838)

From MaRDI portal
Revision as of 00:06, 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
Solving Project Scheduling Problems by Minimum Cut Computations
scientific article

    Statements

    title
    Solving Project Scheduling Problems by Minimum Cut Computations (English)
    0 references
    author
    Rolf H. Möhring
    0 references
    Andreas S. Schulz
    0 references
    Frederik Stork
    0 references
    Marc Uetz
    0 references
    publication date
    19 February 2012
    0 references
    zbMATH Keywords
    project scheduling
    0 references
    resource constraints
    0 references
    linear programming
    0 references

    Identifiers

    zbMATH DE Number
    6007494
    0 references
    OpenAlex ID
    W2111185171
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3114838&oldid=32519993"
    Powered by MediaWiki