Approximation of the competitive facility location problem with MIPs (Q1725607)
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: Approximation of the competitive facility location problem with MIPs |
scientific article; zbMATH DE number 7023703
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation of the competitive facility location problem with MIPs |
scientific article; zbMATH DE number 7023703 |
Statements
Approximation of the competitive facility location problem with MIPs (English)
0 references
14 February 2019
0 references
location
0 references
Stackelberg game
0 references
bi-level programming
0 references
cut generation
0 references
branch-and-bound
0 references
0 references
0 references
0 references
0 references
0.9393395
0 references
0.91205966
0 references
0.90626353
0 references
0.90504694
0 references
0.8996539
0 references
0.8980986
0 references
0.89741343
0 references
