The knapsack problem with generalized upper bounds
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.
scientific article; zbMATH DE number 4106609
scientific article