Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems (Q3404461)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5668031
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems |
scientific article; zbMATH DE number 5668031 |
Statements
Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems (English)
0 references
9 February 2010
0 references
telecommunication networks
0 references
multilayer network design
0 references
preprocessing
0 references
integer linear programming
0 references
cutting planes
0 references
MIP-based heuristics
0 references
0 references
0 references
0.92251307
0 references
0.91812575
0 references
0.9111383
0 references
0.91105074
0 references
0.90888673
0 references
0 references
0.8865263
0 references
0.88541615
0 references
0.8843827
0 references
