Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (Q5891541): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs / rank | |||
Normal rank | |||
Latest revision as of 05:24, 5 July 2024
scientific article; zbMATH DE number 6033926
| 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 6033926 |
Statements
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (English)
0 references
13 May 2012
0 references
hop constrained Steiner trees
0 references
connected facility location
0 references
mixed integer programming models
0 references
