Computing the Minimum Cost Pipe Network Interconnecting One Sink and Many Sources (Q4702334): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:53, 7 February 2024
scientific article; zbMATH DE number 1368661
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the Minimum Cost Pipe Network Interconnecting One Sink and Many Sources |
scientific article; zbMATH DE number 1368661 |
Statements
Computing the Minimum Cost Pipe Network Interconnecting One Sink and Many Sources (English)
0 references
24 November 1999
0 references
minimum cost pipe network
0 references
generalized Steiner minimum tree problem
0 references
bounding theorem
0 references
backtrack
0 references
interior-point methods
0 references
k-optimal
0 references
communication networks
0 references
