Accelerating the B\&B algorithm for integer programming based on flatness information: an approach applied to the multidimensional knapsack problem (Q4577935)
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: Accelerating the B\&B algorithm for integer programming based on flatness information: an approach applied to the multidimensional knapsack problem |
scientific article; zbMATH DE number 6913905
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Accelerating the B\&B algorithm for integer programming based on flatness information: an approach applied to the multidimensional knapsack problem |
scientific article; zbMATH DE number 6913905 |
Statements
6 August 2018
0 references
integer programming
0 references
branch-and-bound method
0 references
branching rule
0 references
algorithm efficiency
0 references
0 references
0.8634504675865173
0 references
0.7994363307952881
0 references
0.734505832195282
0 references
0.7293110489845276
0 references
