Pages that link to "Item:Q4088574"
From MaRDI portal
The following pages link to Merging and Sorting Applied to the Zero-One Knapsack Problem (Q4088574):
Displaying 13 items.
- A new enumeration scheme for the knapsack problem (Q1095029) (← links)
- Dynamic programming algorithms for the zero-one knapsack problem (Q1138485) (← links)
- Solution of the zero-one multiple knapsack problem (Q1142701) (← links)
- An algorithm and efficient data structures for the binary knapsack problem (Q1255893) (← links)
- Solving dense subset-sum problems by using analytical number theory (Q1262760) (← links)
- On space-efficient algorithms for certain NP-complete problems (Q1314378) (← links)
- Shift-and-merge technique for the DP solution of the time-constrained backpacker problem (Q1762021) (← 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)
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106) (← links)
- A heuristic routine for solving large loading problems (Q3962774) (← links)
- A hybrid approach to discrete mathematical programming (Q4170534) (← links)
- Local-search based heuristics for advertisement scheduling (Q6658437) (← links)
