Technical Note—On the Complexity of Some Classes of Location Problems (Q4024323)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Technical Note—On the Complexity of Some Classes of Location Problems |
scientific article; zbMATH DE number 109111
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Technical Note—On the Complexity of Some Classes of Location Problems |
scientific article; zbMATH DE number 109111 |
Statements
Technical Note—On the Complexity of Some Classes of Location Problems (English)
0 references
25 February 1993
0 references
complexity bound improvements
0 references
planar 1-center rectilinear roundtrip location model
0 references
1-center retilinear asymmetric distance location
0 references
equity maximizing facility location
0 references
maximal direct covering tree problem
0 references
0.8124731183052063
0 references
0.812236487865448
0 references
0.7842216491699219
0 references
0.7817007303237915
0 references
