Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (Q5892561): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10107-009-0297-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2100344930 / rank | |||
Normal rank | |||
Revision as of 19:06, 19 March 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
