The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation (Q1869670): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0377-2217(02)00271-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2006896692 / rank | |||
Normal rank | |||
Latest revision as of 09:22, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation |
scientific article |
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
