The knapsack problem with generalized upper bounds (Q1122484)
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 4106609
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The knapsack problem with generalized upper bounds |
scientific article; zbMATH DE number 4106609 |
Statements
The knapsack problem with generalized upper bounds (English)
0 references
1989
0 references
A pipe production scheduling problem is modelled. The corresponding model is an integer programming problem with nonnegative coefficients in the constraints. The author calls it a knapsack problem with generalized upper bounds. Dynamic programming is used to achieve a solution. A knapsack problem solved by enumeration and approximation methods is applied as a subproblem.
0 references
production scheduling
0 references
knapsack problem
0 references
generalized upper bounds
0 references
enumeration
0 references
approximation
0 references
0 references
0 references
0.9223318
0 references
0 references
0.9184407
0 references
0.9183613
0 references
0.9167039
0 references
0.9157849
0 references
