A polygonal upper bound for the efficient set for single-facility location problems with mixed norms (Q1804560)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 755288
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polygonal upper bound for the efficient set for single-facility location problems with mixed norms |
scientific article; zbMATH DE number 755288 |
Statements
A polygonal upper bound for the efficient set for single-facility location problems with mixed norms (English)
0 references
11 June 1995
0 references
multiobjective single-facility location problem
0 references
mixed norms
0 references
set of efficient points
0 references
polygonal hull of the demand points
0 references
0.9164639711380004
0 references
0.8293660879135132
0 references
0.8177430629730225
0 references
0.8135581016540527
0 references
0.8126724362373352
0 references
