An algorithm for the computation of knapsack functions

DOI10.1016/0022-247X(69)90185-1zbMath0169.22305OpenAlexW2035091828MaRDI QIDQ2531204

Harold Greenberg

Publication date: 1969

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(69)90185-1

zbMATH Keywords

operations research

Related Items (3)

A new enumeration scheme for the knapsack problem ⋮ A special class parametric of knapsack problems: Analytic aids and heuristics ⋮ Accelerating Greenberg's method for the computation of knapsack functions

Cites Work

• A Linear Programming Approach to the Cutting-Stock Problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• A Finite Renewal Algorithm for the Knapsack and Turnpike Models
• The Theory and Computation of Knapsack Functions

This page was built for publication: An algorithm for the computation of knapsack functions