An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable (Q645559)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5969582
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable |
scientific article; zbMATH DE number 5969582 |
Statements
An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable (English)
0 references
8 November 2011
0 references
knapsack problem
0 references
mixed integer programming
0 references
branch and bound
0 references
0.96174186
0 references
0.9531609
0 references
0.9383764
0 references
0.93364465
0 references
0.9280198
0 references
0.9245173
0 references
0 references
0.9194481
0 references
0.91857487
0 references
0 references
