Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems (Q2140266)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems |
scientific article |
Statements
Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems (English)
0 references
20 May 2022
0 references
branch and bound
0 references
machine learning
0 references
binary optimization
0 references
