Strong lower bounds for the prize collecting Steiner problem in graphs (Q1827870)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strong lower bounds for the prize collecting Steiner problem in graphs |
scientific article |
Statements
Strong lower bounds for the prize collecting Steiner problem in graphs (English)
0 references
6 August 2004
0 references
Prize collecting Steiner problem in graphs
0 references
Linear programming relaxation
0 references
Lower bound
0 references
0 references
