Bounds and heuristics for the shortest capacitated paths problem (Q1850995)

From MaRDI portal
Revision as of 10:22, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Bounds and heuristics for the shortest capacitated paths problem
scientific article

    Statements

    Bounds and heuristics for the shortest capacitated paths problem (English)
    0 references
    0 references
    0 references
    0 references
    15 December 2002
    0 references
    minimum cost integer multicommodity flow problem
    0 references
    bandwidth packing problem
    0 references
    Lagrangian relaxation
    0 references
    tabu search
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references