Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints (Q4004739)
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 57792
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints |
scientific article; zbMATH DE number 57792 |
Statements
Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints (English)
0 references
27 September 1992
0 references
cutting plane
0 references
fiber optic communication networks
0 references
minimum cost network design
0 references
0.8903163075447083
0 references
0.8883146643638611
0 references
0.8673842549324036
0 references
