A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints (Q1433165)
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: A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints |
scientific article; zbMATH DE number 2075498
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints |
scientific article; zbMATH DE number 2075498 |
Statements
A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints (English)
0 references
15 June 2004
0 references
mixed integer knapsack problem
0 references
branch-and-bound algorithm
0 references
multiple choice constraints
0 references
0.93022525
0 references
0.91917896
0 references
0.9169115
0 references
0.9153466
0 references
0.9133067
0 references
0.9128243
0 references
0.90778273
0 references
0.89899564
0 references
