Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (Q5892561)
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: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs |
scientific article; zbMATH DE number 5909177
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs |
scientific article; zbMATH DE number 5909177 |
Statements
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (English)
0 references
17 June 2011
0 references
tree algorithms
0 references
integer programming: formulations
0 references
cutting planes
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
