A linear programming based approach to the Steiner tree problem with a fixed number of terminals (Q6068538): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1002/net.21913 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NET.21913 / rank | |||
Normal rank | |||
Latest revision as of 18:08, 30 December 2024
scientific article; zbMATH DE number 7764307
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear programming based approach to the Steiner tree problem with a fixed number of terminals |
scientific article; zbMATH DE number 7764307 |
Statements
A linear programming based approach to the Steiner tree problem with a fixed number of terminals (English)
0 references
13 November 2023
0 references
convex hull
0 references
independent subproblems
0 references
integer programming
0 references
laminar family
0 references
linear programming
0 references
Steiner tree
0 references
