On the best choice of a branching variable in the subset sum problem (Q1744347)
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: On the best choice of a branching variable in the subset sum problem |
scientific article; zbMATH DE number 6862903
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the best choice of a branching variable in the subset sum problem |
scientific article; zbMATH DE number 6862903 |
Statements
On the best choice of a branching variable in the subset sum problem (English)
0 references
23 April 2018
0 references
branch-and-bound method
0 references
computational complexity
0 references
subset sum problem
0 references
0 references
0 references
0.8288229703903198
0 references
0.788859486579895
0 references
0.7718616724014282
0 references
0.7661465406417847
0 references
