Efficient Algorithms for the (Weighted) Minimum Circle Problem (Q3947425): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q63549485, #quickstatements; #temporary_batch_1712286835472 |
||
| (3 intermediate revisions by 3 users 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.1287/opre.30.4.777 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2139115571 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q63549485 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 05:55, 5 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient Algorithms for the (Weighted) Minimum Circle Problem |
scientific article |
Statements
Efficient Algorithms for the (Weighted) Minimum Circle Problem (English)
0 references
1982
0 references
weighted minimum covering circle problem
0 references
single facility location
0 references
classification scheme
0 references
efficient new algorithms
0 references
computational tests
0 references
