A maxmin location problem with nonconvex feasible region (Q4347413)

From MaRDI portal
Revision as of 03:29, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1045778
Language Label Description Also known as
English
A maxmin location problem with nonconvex feasible region
scientific article; zbMATH DE number 1045778

    Statements

    A maxmin location problem with nonconvex feasible region (English)
    0 references
    10 March 1998
    0 references
    obnoxious facility
    0 references
    non-convex programming
    0 references
    locating a point in a given convex polyhedron
    0 references
    minimum Euclidean distance
    0 references
    geometrical procedure
    0 references

    Identifiers