Exact approaches for solving a covering problem with capacitated subtrees (Q1722966): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2019.01.008 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128559924 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2019.01.008 / rank | |||
Normal rank | |||
Latest revision as of 06:57, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact approaches for solving a covering problem with capacitated subtrees |
scientific article |
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
