Pages that link to "Item:Q5560785"
From MaRDI portal
The following pages link to A Finite Renewal Algorithm for the Knapsack and Turnpike Models (Q5560785):
Displaying 14 items.
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem (Q428109) (← links)
- Convergence of selections with applications in optimization (Q805503) (← links)
- An algorithm for the periodic solutions in the knapsack problem (Q1075253) (← links)
- A new enumeration scheme for the knapsack problem (Q1095029) (← links)
- Degeneracy in infinite horizon optimization (Q1123819) (← links)
- A better step-off algorithm for the knapsack problem (Q1137512) (← links)
- Accelerating Greenberg's method for the computation of knapsack functions (Q1217017) (← links)
- Optimizing two types of discrete functions, subject to linear restrictions (Q1234633) (← links)
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm (Q1245074) (← links)
- An empirical analysis of exact algorithms for the unbounded knapsack problem (Q1735169) (← links)
- Conditions for the discovery of solution horizons (Q2368078) (← links)
- An algorithm for the computation of knapsack functions (Q2531204) (← links)
- Ameso optimization: a relaxation of discrete midpoint convexity (Q2659175) (← links)
- A Reach and Bound algorithm for acyclic dynamic-programming networks (Q3632964) (← links)