The Euclidean Steiner tree problem in \(\mathbb{R}^{n}\): A mathematical programming formulation (Q1593533): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1018903619285 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W32401548 / rank | |||
Normal rank | |||
Latest revision as of 10:54, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Euclidean Steiner tree problem in \(\mathbb{R}^{n}\): A mathematical programming formulation |
scientific article |
Statements
The Euclidean Steiner tree problem in \(\mathbb{R}^{n}\): A mathematical programming formulation (English)
0 references
17 January 2001
0 references
Euclidean Steiner tree problem
0 references
duality in nonconvex mixed-integer programming
0 references
