Lagrangian relaxation and enumeration for solving constrained shortest-path problems (Q3548726)

From MaRDI portal
Revision as of 18:05, 12 October 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
Lagrangian relaxation and enumeration for solving constrained shortest-path problems
scientific article

    Statements

    Lagrangian relaxation and enumeration for solving constrained shortest-path problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 December 2008
    0 references
    near-shortest paths
    0 references
    label-setting algorithm
    0 references

    Identifiers