Pages that link to "Item:Q1281395"
From MaRDI portal
The following pages link to A fast algorithm for strongly correlated knapsack problems (Q1281395):
Displaying 10 items.
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem (Q428109) (← links)
- A computational note on the Martello-Toth knapsack algorithm (Q1328611) (← links)
- Approximation algorithms for knapsack problems with cardinality constraints (Q1569936) (← links)
- An incomplete \(m\)-exchange algorithm for solving the large-scale multi-scenario knapsack problem (Q1761118) (← links)
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (Q2196299) (← links)
- Integer knapsack problems with set-up weights (Q2642635) (← links)
- Algorithms for some hard knapsack problems (Q2735077) (← links)
- The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance (Q3116733) (← links)
- An improved branch and bound algorithm for a strongly correlated unbounded knapsack problem (Q4661050) (← links)
- Optimal Genetic Screening for Cystic Fibrosis (Q5031012) (← links)