The knapsack problem with generalized upper bounds
type: Item
instance of: scholarly article
title: The knapsack problem with generalized upper bounds
zbMATH Open document ID: 0675.90062
DOI: 10.1016/0377-2217(89)90110-0
author: Salah E. Elmaghraby
published in: European Journal of Operational Research
publication date: 1989-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 4106609
zbMATH Keywords: production scheduling
zbMATH Keywords: knapsack problem
zbMATH Keywords: generalized upper bounds
zbMATH Keywords: enumeration
zbMATH Keywords: approximation
MaRDI profile type: Publication
full work available at URL: 0377-2217(89)90110-0
OpenAlex ID: W2042474998
cites work: A heuristic solution of the rectangular cutting stock problem
cites work: An Algorithm for Large Zero-One Knapsack Problems
cites work: Q3888838
cites work: Computational results with a branch-and-bound algorithm for the general knapsack problem
cites work: Hard Knapsack Problems
cites work: Q3882189
cites work: On the reduction method for integer linear programs. II
cites work: Q4166568
cites work: Technical Note—The Multiperiod Knapsack Problem
cites work: A o(n logn) algorithm for LP knapsacks with GUB constraints
cites work: A better step-off algorithm for the knapsack problem
cites work: APPROXIMATE ALGORITHMS FOR THE MULTIPLE-CHOICE CONTINUOUS KNAPSACK PROBLEMS
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Experiments in integer programming
cites work: A note on the knapsack problem with special ordered sets
cites work: New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
cites work: Heuristic algorithms for the multiple knapsack problem
cites work: The imbedded state approach to reducing dimensionality in dynamic programs of higher dimensions
cites work: Approximate Algorithms for the 0/1 Knapsack Problem
cites work: The knapsack problem: A survey
cites work: The Multiple-Choice Knapsack Problem
cites work: Dynamic programming algorithms for the zero-one knapsack problem
cites work: The Linear Multiple Choice Knapsack Problem
Recommended article: A new upper bound for the multiple knapsack problem
Recommended article: Bounds for nested knapsack problems
Recommended article: A solution procedure for general knapsack problems with a few constraints
Recommended article: Q3481489
Recommended article: Exact methods for the knapsack problem and its generalizations
Recommended article: An algorithm for solving a class of knapsack problems and its generalization
Recommended article: Q5753744
Recommended article: Q3471851
Recommended article: Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
Recommended article: Improved lower and upper bounds for the number of feasible solutions to a knapsaek problem
description: scientific article; zbMATH DE number 4106609