Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs. (Q1426688)
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: Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs. |
scientific article; zbMATH DE number 2057167
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs. |
scientific article; zbMATH DE number 2057167 |
Statements
Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs. (English)
0 references
15 March 2004
0 references
Integer programming
0 references
Telecommunications
0 references
Heuristics
0 references
0 references
