Maintaining longest paths incrementally (Q816679)

From MaRDI portal
Revision as of 11:40, 24 June 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
Maintaining longest paths incrementally
scientific article

    Statements

    title
    Maintaining longest paths incrementally (English)
    0 references
    author
    Irit Katriel
    0 references
    Laurent Michel
    0 references
    Pascal Van Hentenryck
    0 references
    published in
    Constraints
    0 references
    publication date
    23 February 2006
    0 references
    Mathematics Subject Classification ID
    68P05
    0 references
    68R10
    0 references
    68T20
    0 references
    05C85
    0 references
    zbMATH DE Number
    5009058
    0 references
    zbMATH Keywords
    incremental
    0 references
    longest path
    0 references
    heaviest path
    0 references
    bounded computation
    0 references
    graph
    0 references
    constraint
    0 references
    local search
    0 references
    scheduling
    0 references
    describes a project that uses
    iOpt
    0 references
    EasyLocal++
    0 references
    Localizer++
    0 references
    Localizer
    0 references
    SALSA
    0 references
    COMET
    0 references
    OpenAlex ID
    W2006906930
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q816679&oldid=34862639"
    Powered by MediaWiki