The following pages link to A hard knapsack problem (Q3780004):
Displaying 11 items.
- Yet harder knapsack problems (Q653327) (← links)
- Using modifications to Grover's search algorithm for quantum global optimization (Q992656) (← links)
- A hybrid algorithm for the unbounded knapsack problem (Q1013302) (← links)
- Sensitivity analysis for knapsack problems: Another negative result (Q1304487) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- Where are the hard knapsack problems? (Q1772862) (← links)
- Solving the knapsack problem via \(\mathbb Z\)-transform (Q1870019) (← links)
- Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis (Q2027074) (← links)
- A new class of hard problem instances for the 0-1 knapsack problem (Q2140267) (← links)
- Asignacion de recuerdos max-min: Propiedades y algoritmos (Q3354440) (← links)
- Technical Note—Some Very Easy Knapsack/Partition Problems (Q3703590) (← links)
