The following pages link to Hard Knapsack Problems (Q3893671):
Displaying 41 items.
- Toward a model for backtracking and dynamic programming (Q430838) (← links)
- A stronger model of dynamic programming algorithms (Q547305) (← links)
- Yet harder knapsack problems (Q653327) (← links)
- A note on the complexity of a partition algorithm (Q788493) (← links)
- A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems (Q800229) (← links)
- Column basis reduction and decomposable knapsack problems (Q834182) (← links)
- Bounds on the size of branch-and-bound proofs for integer knapsacks (Q924879) (← links)
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes (Q951099) (← links)
- On exponential time lower bound of Knapsack under backtracking (Q964408) (← links)
- Using modifications to Grover's search algorithm for quantum global optimization (Q992656) (← links)
- Approximation schemes for the subset-sum problem: Survey and experimental analysis (Q1069445) (← links)
- Exact methods for the knapsack problem and its generalizations (Q1083032) (← links)
- A new enumeration scheme for the knapsack problem (Q1095029) (← links)
- The knapsack problem with generalized upper bounds (Q1122484) (← links)
- Heuristics and their design: A survey (Q1152854) (← links)
- Solving dense subset-sum problems by using analytical number theory (Q1262760) (← links)
- Pseudopolynomial algorithms for the solution of backpack problems (Q1325402) (← links)
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
- Some thoughts on combinatorial optimisation (Q1388818) (← links)
- An efficient fully polynomial approximation scheme for the Subset-Sum problem. (Q1400576) (← links)
- A new fully polynomial time approximation scheme for the interval subset sum problem (Q1675574) (← links)
- Thinner is not always better: cascade knapsack problems (Q1727953) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem (Q1894383) (← links)
- Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis (Q2027074) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899) (← links)
- Lower bound on size of branch-and-bound trees for solving lot-sizing problem (Q2083992) (← links)
- A new class of hard problem instances for the 0-1 knapsack problem (Q2140267) (← links)
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) (Q2373937) (← links)
- Simple lifted cover inequalities and hard knapsack problems (Q2581317) (← links)
- Lower bounds on the size of general branch-and-bound trees (Q2687056) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
- A solution method for a knapsack problem and its variant (Q3028724) (← links)
- Multivariable Branching: A 0-1 Knapsack Problem Case Study (Q5084602) (← links)
- An exact algorithm for the subset sum problem (Q5955091) (← links)
- Branch-and-bound solves random binary IPs in poly\((n)\)-time (Q6041109) (← links)
- A theoretical and computational analysis of full strong-branching (Q6126652) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions (Q6168585) (← links)
- Advice complexity of adaptive priority algorithms (Q6180750) (← links)
- A hard problem that is almost always easy (Q6487965) (← links)
