An exact branch and bound algorithm for the Steiner Problem in Graphs (Q6085757)
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 7776492
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact branch and bound algorithm for the Steiner Problem in Graphs |
scientific article; zbMATH DE number 7776492 |
Statements
An exact branch and bound algorithm for the Steiner Problem in Graphs (English)
0 references
12 December 2023
0 references
0 references
0.9546577
0 references
0.9382013
0 references
0.93189776
0 references
0 references
0.9258531
0 references
0.92534894
0 references
