An algorithm for the continuous variable upper bound knapsack problem (Q1108930)
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: Publication:1108930 |
scientific article; zbMATH DE number 4068612
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for the continuous variable upper bound knapsack problem |
scientific article; zbMATH DE number 4068612 |
Statements
An algorithm for the continuous variable upper bound knapsack problem (English)
0 references
1988
0 references
This paper presents a polynomial algorithm for a class of knapsack problems where some of the problem variables serve as bounds on other problem variables. The author applies this algorithm to the machine loading problem.
0 references
polynomial algorithm
0 references
knapsack problems
0 references
machine loading
0 references
0.8159884214401245
0 references
0.7908825874328613
0 references
0.7890302538871765
0 references
0.7823228240013123
0 references
