The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation (Q1869670)
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: The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation |
scientific article; zbMATH DE number 1902779
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation |
scientific article; zbMATH DE number 1902779 |
Statements
The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation (English)
0 references
28 April 2003
0 references
Multiple criteria analysis
0 references
semi-obnoxious
0 references
location
0 references
planar networks
0 references
0 references
0.8449946
0 references
0.8370915
0 references
0.82407993
0 references
0.81288236
0 references
0.8093908
0 references
