Exact approaches for solving a covering problem with capacitated subtrees (Q1722966)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Exact approaches for solving a covering problem with capacitated subtrees |
scientific article; zbMATH DE number 7024941
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact approaches for solving a covering problem with capacitated subtrees |
scientific article; zbMATH DE number 7024941 |
Statements
Exact approaches for solving a covering problem with capacitated subtrees (English)
0 references
19 February 2019
0 references
covering problems
0 references
column generation
0 references
Dantzig-Wolfe decomposition
0 references
branch-and-bound
0 references
dynamic programming
0 references
0 references
0 references
0.9152181
0 references
0.91014504
0 references
0 references
0 references
0.89408714
0 references
0.89408714
0 references
0 references
