A maxmin location problem with nonconvex feasible region (Q4347413): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1057/palgrave.jors.2600382 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1989965063 / rank | |||
Normal rank | |||
Latest revision as of 03:29, 20 March 2024
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
