A Finite Renewal Algorithm for the Knapsack and Turnpike Models

DOI10.1287/OPRE.15.2.319MaRDI QIDQ5560785zbMATH OpenOpenAlexFDO

Authors Jeremy F. Shapiro, Harvey M. Wagner

Publication date 1967

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.15.2.319

zbMATH Keywords

operations research

Cited in

(14)

• An algorithm for the periodic solutions in the knapsack problem
• A new enumeration scheme for the knapsack problem
• Degeneracy in infinite horizon optimization
• A better step-off algorithm for the knapsack problem
• Accelerating Greenberg's method for the computation of knapsack functions
• Optimizing two types of discrete functions, subject to linear restrictions
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm
• An empirical analysis of exact algorithms for the unbounded knapsack problem
• Conditions for the discovery of solution horizons
• An algorithm for the computation of knapsack functions
• Ameso optimization: a relaxation of discrete midpoint convexity
• A Reach and Bound algorithm for acyclic dynamic-programming networks
• Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem
• Convergence of selections with applications in optimization

This page was built for publication: A Finite Renewal Algorithm for the Knapsack and Turnpike Models

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