A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints (Q1433165): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:13, 31 January 2024
scientific article
| 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 |
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
