Regenerator location problem: polyhedral study and effective branch-and-cut algorithms (Q1752767)
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: Regenerator location problem: polyhedral study and effective branch-and-cut algorithms |
scientific article; zbMATH DE number 6872907
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Regenerator location problem: polyhedral study and effective branch-and-cut algorithms |
scientific article; zbMATH DE number 6872907 |
Statements
Regenerator location problem: polyhedral study and effective branch-and-cut algorithms (English)
0 references
24 May 2018
0 references
optical network design
0 references
regenerator placement
0 references
integer programming
0 references
branch and cut
0 references
facets
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.95276606
0 references
0.9202455
0 references
0 references
0.91282696
0 references
0.88117474
0 references
0.88024503
0 references
0 references
0.84801114
0 references
0.84375966
0 references
