A cutting plane algorithm for the capacitated connected facility location problem (Q2393652)
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: A cutting plane algorithm for the capacitated connected facility location problem |
scientific article; zbMATH DE number 6196769
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A cutting plane algorithm for the capacitated connected facility location problem |
scientific article; zbMATH DE number 6196769 |
Statements
A cutting plane algorithm for the capacitated connected facility location problem (English)
0 references
8 August 2013
0 references
capacitated network design
0 references
facility location
0 references
connected facility location
0 references
mixed integer programming models
0 references
telecommunications
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8484798669815063
0 references
0.8455510139465332
0 references
0.818855881690979
0 references
0.816264271736145
0 references
0.8145536780357361
0 references
