Solving RCPSP/max by lazy clause generation (Q2434317)

From MaRDI portal
Revision as of 07:32, 7 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
Solving RCPSP/max by lazy clause generation
scientific article

    Statements

    title
    Solving RCPSP/max by lazy clause generation (English)
    0 references
    author
    Andreas Schutt
    0 references
    Thibaut Feydy
    0 references
    Peter J. Stuckey
    0 references
    Mark G. Wallace
    0 references
    publication date
    5 February 2014
    0 references
    zbMATH Keywords
    project scheduling
    0 references
    resource constraints
    0 references
    time windows
    0 references
    generalized precedence constraints
    0 references
    lazy clause generation
    0 references
    constraint programming
    0 references
    describes a project that uses
    Chaff
    0 references
    PSPLIB
    0 references
    CHIP
    0 references
    G12
    0 references
    ILOG SCHEDULE
    0 references
    cites work
    Q3468865
    0 references
    On a routing problem
    0 references
    Logic Programming
    0 references
    Q3292914
    0 references
    Q4254883
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90B35
    0 references
    68M20
    0 references
    90C09
    0 references
    zbMATH DE Number
    6255180
    0 references
    OpenAlex ID
    W2125886152
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2434317&oldid=35372024"
    Powered by MediaWiki