An algorithm for the periodic solutions in the knapsack problem

DOI10.1016/0022-247X(85)90219-7MaRDI QIDQ1075253zbMATH OpenFDO

Authors Harold Greenberg

Publication date 1985

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(85)90219-7

zbMATH Keywords

algorithmperiodic solutions for the knapsack problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Dynamic programming (90C39)

Review text

An algorithm is described for directly finding periodic solutions for the knapsack problem, based on the dynamic programming technique.

Cites work

• A Finite Renewal Algorithm for the Knapsack and Turnpike Models
• scientific article; zbMATH DE number 3427118 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3314878 (Why is no real title available?)
• The Theory and Computation of Knapsack Functions

Cited in

(7)

• On the multiperiod binary knapsack problem
• A relation between the knapsack and group knapsack problems
• Approximating the 3-period incremental knapsack problem
• A constructive periodicity bound for the unbounded knapsack problem
• The unbounded knapsack problem
• scientific article; zbMATH DE number 3900493 (Why is no real title available?)
• Analysis of the knapsack problem using L-partition

This page was built for publication: An algorithm for the periodic solutions in the knapsack problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1075253)