Pages that link to "Item:Q5684502"
From MaRDI portal
The following pages link to Technical Note—Solution of the Value-Independent Knapsack Problem by Partitioning (Q5684502):
Displaying 7 items.
- A new enumeration scheme for the knapsack problem (Q1095029) (← links)
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm (Q1245074) (← links)
- Solving dense subset-sum problems by using analytical number theory (Q1262760) (← links)
- An efficient pruning algorithm for value independent knapsack problem using a DAG structure (Q1891244) (← links)
- Two linear approximation algorithms for the subset-sum problem (Q1969831) (← links)
- Faster Pseudopolynomial Time Algorithms for Subset Sum (Q4972686) (← links)
- Preprocessing to reduce vehicle capacity for routing problems (Q6097441) (← links)
