A Finite Renewal Algorithm for the Knapsack and Turnpike Models
From MaRDI portal
Publication:5560785
DOI10.1287/opre.15.2.319zbMath0173.21501OpenAlexW2060507898MaRDI QIDQ5560785
Jeremy F. Shapiro, Wagner, Harvey M.
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
Related Items (14)
Conditions for the discovery of solution horizons ⋮ A new enumeration scheme for the knapsack problem ⋮ Ameso optimization: a relaxation of discrete midpoint convexity ⋮ Degeneracy in infinite horizon optimization ⋮ A better step-off algorithm for the knapsack problem ⋮ Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem ⋮ An empirical analysis of exact algorithms for the unbounded 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 algorithm for the computation of knapsack functions ⋮ A Reach and Bound algorithm for acyclic dynamic-programming networks ⋮ Convergence of selections with applications in optimization ⋮ An algorithm for the periodic solutions in the knapsack problem
This page was built for publication: A Finite Renewal Algorithm for the Knapsack and Turnpike Models
