Network distance characteristics that affect computational effort in \(p\)-median location problems (Q1841151)

From MaRDI portal
Revision as of 10:29, 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
Network distance characteristics that affect computational effort in \(p\)-median location problems
scientific article

    Statements

    Network distance characteristics that affect computational effort in \(p\)-median location problems (English)
    0 references
    22 February 2001
    0 references
    location
    0 references
    combinatorial optimization
    0 references
    heuristics
    0 references
    \(p\)-median
    0 references
    Euclidean inter-point distances
    0 references
    shortest paths developed from a predefined network
    0 references
    randomly generated distance matrices
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers