An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration (Q319357)

From MaRDI portal
Revision as of 16:39, 12 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
An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration
scientific article

    Statements

    An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration (English)
    0 references
    0 references
    0 references
    0 references
    6 October 2016
    0 references
    project scheduling
    0 references
    interval order
    0 references
    column generation
    0 references
    constraint propagation
    0 references
    antichain
    0 references
    0 references
    0 references
    0 references

    Identifiers