Approximating the two-level facility location problem via a quasi-greedy approach (Q2494518)
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: Approximating the two-level facility location problem via a quasi-greedy approach |
scientific article; zbMATH DE number 5036611
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the two-level facility location problem via a quasi-greedy approach |
scientific article; zbMATH DE number 5036611 |
Statements
Approximating the two-level facility location problem via a quasi-greedy approach (English)
0 references
28 June 2006
0 references
Two-level facility location
0 references
Approximation algorithm
0 references
Linear programming relaxation
0 references
Quasi-greedy approach
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9999988675117492
0 references
0.8566030859947205
0 references
0.8312017321586609
0 references
0.8221079111099243
0 references
