Solving minimum-cost shared arborescence problems (Q1751722)
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 6873551
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving minimum-cost shared arborescence problems |
scientific article; zbMATH DE number 6873551 |
Statements
Solving minimum-cost shared arborescence problems (English)
0 references
25 May 2018
0 references
combinatorial optimization
0 references
Benders decomposition
0 references
integer programming
0 references
telecommunications
0 references
bioinformatics
0 references
0 references
0 references
0 references
0.7598816156387329
0 references
0.742650032043457
0 references
0.7422006130218506
0 references
0.73527991771698
0 references
0.7331435680389404
0 references
