Probabilistic analysis of an lp relaxation bound for the steiner problem in networks (Q4732318): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Send-and-Split Method for Minimum-Concave-Cost Network Flows / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3048571 / rank | |||
Normal rank | |||
Latest revision as of 11:00, 20 June 2024
scientific article; zbMATH DE number 4118185
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Probabilistic analysis of an lp relaxation bound for the steiner problem in networks |
scientific article; zbMATH DE number 4118185 |
Statements
Probabilistic analysis of an lp relaxation bound for the steiner problem in networks (English)
0 references
1989
0 references
relaxation bound
0 references
Steiner tree problem in networks
0 references
