Minisum location problem with farthest Euclidean distances (Q857948)

From MaRDI portal
Revision as of 11:39, 6 July 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
Minisum location problem with farthest Euclidean distances
scientific article

    Statements

    Minisum location problem with farthest Euclidean distances (English)
    0 references
    0 references
    0 references
    5 January 2007
    0 references
    0 references
    constrained Weber problem
    0 references
    fixed region
    0 references
    bound test
    0 references
    greedy choice
    0 references
    choice of starting point
    0 references