The Euclidean Steiner tree problem in \(\mathbb{R}^{n}\): A mathematical programming formulation (Q1593533)
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: The Euclidean Steiner tree problem in R^n: A mathematical programming formulation |
scientific article; zbMATH DE number 1554228
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Euclidean Steiner tree problem in \(\mathbb{R}^{n}\): A mathematical programming formulation |
scientific article; zbMATH DE number 1554228 |
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
0.8879250288009644
0 references
0.8864796161651611
0 references
0.8445181250572205
0 references
0.8444969654083252
0 references
0.8211790323257446
0 references
