Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context (Q2371346)

From MaRDI portal
Revision as of 17:35, 3 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context
scientific article

    Statements

    Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context (English)
    0 references
    0 references
    0 references
    4 July 2007
    0 references
    discrete optimization
    0 references
    (T) integer programming
    0 references
    (T) graph theory
    0 references
    column-generation
    0 references
    resource-constrained shortest-path problem
    0 references
    multiple-resource
    0 references
    multiple-choice Knapsack problem
    0 references
    shortest-path problem with resource windows
    0 references

    Identifiers