The location-dispatching problem: polyhedral results and content delivery network design (Q496706)
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 location-dispatching problem: polyhedral results and content delivery network design |
scientific article; zbMATH DE number 6484212
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The location-dispatching problem: polyhedral results and content delivery network design |
scientific article; zbMATH DE number 6484212 |
Statements
The location-dispatching problem: polyhedral results and content delivery network design (English)
0 references
22 September 2015
0 references
location
0 references
integer program
0 references
polytope
0 references
branch-and-cut algorithm
0 references
content delivery network design
0 references
0.9822152256965636
0 references
0.7478376626968384
0 references
0.7332381010055542
0 references
0.7229777574539185
0 references
