Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (Q5892561): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SteinLib / rank | |||
Normal rank | |||
Revision as of 07:11, 29 February 2024
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
