Solving the Continuous <i>p</i>-Dispersion Problem Using Non-linear Programming (Q4838220): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1057/jors.1995.70 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2056270368 / rank | |||
Normal rank | |||
Latest revision as of 14:23, 19 March 2024
scientific article; zbMATH DE number 772276
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the Continuous <i>p</i>-Dispersion Problem Using Non-linear Programming |
scientific article; zbMATH DE number 772276 |
Statements
Solving the Continuous <i>p</i>-Dispersion Problem Using Non-linear Programming (English)
0 references
1 August 1995
0 references
location of points
0 references
maximally dispersed points is a convex space
0 references
circle- packing
0 references
