Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems (Q2140266)
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: Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems |
scientific article; zbMATH DE number 7530061
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems |
scientific article; zbMATH DE number 7530061 |
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
0.83134085
0 references
0.83114576
0 references
0.8276161
0 references
0.8263765
0 references
0.8223756
0 references
0.81971145
0 references
0.81778145
0 references
0.81727517
0 references
0.81703556
0 references
