A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints (Q1433165): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0305-0548(03)00021-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1974632181 / rank | |||
Normal rank | |||
Latest revision as of 08:39, 30 July 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
