The knapsack problem with generalized upper bounds (Q1122484): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(89)90110-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2042474998 / rank | |||
Normal rank | |||
Revision as of 18:59, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The knapsack problem with generalized upper bounds |
scientific article |
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
