Generating lower bounds for the prize collecting Steiner problem in graphs (Q2741469)
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: Generating lower bounds for the prize collecting Steiner problem in graphs |
scientific article; zbMATH DE number 1642875
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generating lower bounds for the prize collecting Steiner problem in graphs |
scientific article; zbMATH DE number 1642875 |
Statements
24 October 2001
0 references
undirected graph
0 references
prize collecting Steiner problem
0 references
tree with minimum weight
0 references
integer programming
0 references
linear programming relaxation
0 references
Generating lower bounds for the prize collecting Steiner problem in graphs (English)
0 references
