Pages that link to "Item:Q2735077"
From MaRDI portal
The following pages link to Algorithms for some hard knapsack problems (Q2735077):
Displaying 14 items.
- An exact algorithm for large unbounded knapsack problems (Q913659) (← links)
- A fast algorithm for strongly correlated knapsack problems (Q1281395) (← links)
- A computational note on the Martello-Toth knapsack algorithm (Q1328611) (← links)
- Solutions of hard knapsack problems using extreme pruning (Q1624979) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- Where are the hard knapsack problems? (Q1772862) (← links)
- A heuristic for the problem of one-dimensional steel coil cutting (Q1983859) (← links)
- Improved Generic Algorithms for Hard Knapsacks (Q3003392) (← links)
- Realization of knapsack problem solving algorithm and some of its applications (Q3655032) (← links)
- Technical Note—Some Very Easy Knapsack/Partition Problems (Q3703590) (← links)
- (Q3751378) (← links)
- (Q3993418) (← links)
- Note: On the set-union Knapsack problem (Q4314864) (← links)
- Hard Equality Constrained Integer Knapsacks (Q5704196) (← links)