The following pages link to Yet harder knapsack problems (Q653327):
Displaying 7 items.
- Limitations of incremental dynamic programming (Q517805) (← links)
- Bounds on the size of branch-and-bound proofs for integer knapsacks (Q924879) (← links)
- On exponential time lower bound of Knapsack under backtracking (Q964408) (← links)
- Where are the hard knapsack problems? (Q1772862) (← links)
- A new class of hard problem instances for the 0-1 knapsack problem (Q2140267) (← links)
- A hard knapsack problem (Q3780004) (← links)
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions (Q6168585) (← links)