The knapsack problem with generalized upper bounds
From MaRDI portal
Publication:1122484
DOI10.1016/0377-2217(89)90110-0zbMath0675.90062OpenAlexW2042474998MaRDI QIDQ1122484
Publication date: 1989
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(89)90110-0
Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Dynamic programming (90C39)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the reduction method for integer linear programs. II
- Experiments in integer programming
- A better step-off algorithm for the knapsack problem
- Dynamic programming algorithms for the zero-one knapsack problem
- Heuristic algorithms for the multiple knapsack problem
- A note on the knapsack problem with special ordered sets
- The imbedded state approach to reducing dimensionality in dynamic programs of higher dimensions
- A o(n logn) algorithm for LP knapsacks with GUB constraints
- APPROXIMATE ALGORITHMS FOR THE MULTIPLE-CHOICE CONTINUOUS KNAPSACK PROBLEMS
- A heuristic solution of the rectangular cutting stock problem
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
- Hard Knapsack Problems
- The Linear Multiple Choice Knapsack Problem
- An Algorithm for Large Zero-One Knapsack Problems
- Technical Note—The Multiperiod Knapsack Problem
- The knapsack problem: A survey
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Approximate Algorithms for the 0/1 Knapsack Problem
- Computational results with a branch-and-bound algorithm for the general knapsack problem
- The Multiple-Choice Knapsack Problem
This page was built for publication: The knapsack problem with generalized upper bounds
