An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem (Q2583134)
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: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem |
scientific article; zbMATH DE number 2246759
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem |
scientific article; zbMATH DE number 2246759 |
Statements
An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem (English)
0 references
13 January 2006
0 references
branch-and-cut
0 references
Steiner arborescence
0 references
prize collecting
0 references
network design
0 references
0 references
0 references
0 references
