Solving the Steiner Tree Problem on a Graph Using Branch and Cut (Q4030930)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 148058
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the Steiner Tree Problem on a Graph Using Branch and Cut |
scientific article; zbMATH DE number 148058 |
Statements
Solving the Steiner Tree Problem on a Graph Using Branch and Cut (English)
0 references
1 April 1993
0 references
branch and cut solver
0 references
Steiner tree problem on a graph
0 references
complete graphs
0 references
randomly generated sparse graphs
0 references
grid graphs
0 references
0.8876615166664124
0 references
0.8832426071166992
0 references
0.841827392578125
0 references
0.822361946105957
0 references
0.8185276985168457
0 references
